Debugging formal specifications: a practical approach using model-based diagnosis and counterstrategies

Könighofer, Robert; Hofferek, Georg; Bloem, Roderick

doi:10.1007/s10009-011-0221-y

Cited by 43 publications

(83 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e speci cation contains an assumption that a docking request is only sent if the mechanism was in a ready state at some point previously, as expressed in the environment assumption G dockRequest -> ONCE(ready). All systems satisfying the speci cation will eventually be ready to accept docking requests, expressed by justice Figure 1: Concrete CS LTS for the docking mechanism speci cation, as computed by existing tools such as [4,10,18].…”

Section: Example Speci Cationmentioning

confidence: 99%

“…To try to understand the problem using existing tools [4,10,18], the engineer can generate a concrete CS, as shown in Fig. 1 (the complete result will list in each state the assignments to all of the variables; to avoid clu er, we show assignments only for states s 4 and s 7 ).…”

Section: Example Speci Cationmentioning

confidence: 99%

“…1 does not contain many states, one can see that even for such a simple and small speci cation, the concrete CS as computed by existing tools is already relatively complicated. Moreover, computing an unrealizable core (as suggested by some tools [4,10]) will not help here, because the core for this example speci cation contains all guarantees and system variables.…”

Section: Example Speci Cationmentioning

confidence: 99%

“…Previous work has shown how the debugging of an unrealizable speci cation, in the context of GR(1), can be done via the extraction of a counter-strategy (CS), which the engineer may explore in order to analyze the source of unrealizability [10,18]. First a Rabin game is played over the speci cation, and then intermediate values saved during the game are used to extract the concrete CS.…”

Section: Introductionmentioning

confidence: 99%

“…Previous works on debugging unrealizable speci cations for reactive synthesis (e.g., [1,4,10,18]) have considered the notion of unrealizable core, and the idea of semi-automatic discovery of possible assumptions to repair an unrealizable speci cation. To the best of our knowledge, all have used concrete CSs and none has considered a symbolic representation such as the JVTS.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A symbolic justice violations transition system for unrealizable GR(1) specifications

Kuvent

Maoz

Ringert

2017

Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering

View full text Add to dashboard Cite

One of the main challenges of reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, is to deal with unrealizable speci cations. Existing approaches to deal with unrealizability, in the context of GR(1), an expressive assumeguarantee fragment of LTL that enables e cient synthesis, include the generation of concrete counter-strategies and the computation of an unrealizable core. Although correct, such approaches produce large and complicated counter-strategies, o en containing thousands of states. is hinders their use by engineers.In this work we present the Justice Violations Transition System (JVTS), a novel symbolic representation of counter-strategies for GR(1). e JVTS is much smaller and simpler than its corresponding concrete counter-strategy. Moreover, it is annotated with invariants that explain how the counter-strategy forces the system to violate the speci cation. We compute the JVTS symbolically, and thus more e ciently, without the expensive enumeration of concrete states. Finally, we provide the JVTS with an on-demand interactive concrete and symbolic play.We implemented our work, validated its correctness, and evaluated it on 14 unrealizable speci cations of autonomous Lego robots as well as on benchmarks from the literature. e evaluation shows not only that the JVTS is in most cases much smaller than the corresponding concrete counter-strategy, but also that its computation is faster. CCS CONCEPTS•So ware and its engineering →Formal methods; So ware verication;

show abstract

Section: Example Speci Cationmentioning

confidence: 99%

Section: Example Speci Cationmentioning

confidence: 99%

Section: Example Speci Cationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%