jvts.pdf (896.84 kB)
Download file

A Symbolic Justice Violations Transition System for Unrealizable GR(1) Specifications

Download (896.84 kB)
conference contribution
posted on 29.05.2018, 14:31 by Aviv Kuvent, Shahar Maoz, Jan Oliver Ringert
One of the main challenges of reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, is to deal with unrealizable specifications. Existing approaches to deal with unrealizability, in the context of GR(1), an expressive assume-guarantee fragment of LTL that enables efficient 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, often containing thousands of states. This 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). The 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 specification. We compute the JVTS symbolically, and thus more efficiently, 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 specifications of autonomous Lego robots as well as on benchmarks from the literature. The 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.

Funding

This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 638049, SYNTECH)

History

Citation

Proceeding ESEC/FSE 2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, 2017, pp. 362-372

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Informatics

Source

11th Joint Meeting of European Software Engineering Conference (ESEC) / ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), Paderborn, GERMANY

Version

AM (Accepted Manuscript)

Published in

Proceeding ESEC/FSE 2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering

Publisher

Association for Computing Machinery (ACM)

isbn

978-1-4503-5105-8

Copyright date

2017

Available date

29/05/2018

Publisher version

https://dl.acm.org/citation.cfm?doid=3106237.3106240

Editors

Bodden, E.;Schafer, W.;VanDeursen, A.;Zisman, A.

Temporal coverage: start date

04/09/2017

Temporal coverage: end date

08/09/2017

Language

en