Sparse Positional Strategies for Safety Games
@inproceedings{Ehlers2012SparsePS, title={Sparse Positional Strategies for Safety Games}, author={R. Ehlers and Daniela Moldovan}, booktitle={SYNT}, year={2012} }
We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to… CONTINUE READING
Figures, Tables, and Topics from this paper
3 Citations
Applications of automata learning in verification and synthesis
- Mathematics, Computer Science
- 2014
- 11
- PDF
Codensity Games for Bisimilarity
- Computer Science
- 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2019
- 3
- PDF
Safraless LTL synthesis considering maximal realizability
- Mathematics, Computer Science
- Acta Informatica
- 2016
- 12
- PDF
References
SHOWING 1-10 OF 26 REFERENCES
Small witnesses, accepting lassos and winning strategies in omega-automata and games
- Computer Science
- ArXiv
- 2011
- 5
- PDF
Bounded synthesis
- Computer Science
- International Journal on Software Tools for Technology Transfer
- 2012
- 184
- PDF
Optimizations for LTL Synthesis
- Computer Science
- 2006 Formal Methods in Computer Aided Design
- 2006
- 168
- PDF
Alternating-time temporal logic
- Computer Science
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- 1997
- 715
- Highly Influential
- PDF
optsat: A Tool for Solving SAT Related Optimization Problems
- Computer Science
- JELIA
- 2006
- 11
- Highly Influential
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
- Computer Science, Mathematics
- CONCUR
- 2006
- 18
- PDF