Symbolic Algorithms for Infinite-State Games
- 22 August 2001
- book chapter
- Published by Springer Nature
- p. 536-550
- https://doi.org/10.1007/3-540-44685-0_36
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Alternating-time temporal logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- A Classification of Symbolic Transition SystemsPublished by Springer Nature ,2000
- Rectangular Hybrid GamesPublished by Springer Nature ,1999
- Verifying networks of timed processesPublished by Springer Nature ,1998
- Alternating refinement relationsPublished by Springer Nature ,1998
- HYTECH: a model checker for hybrid systemsInternational Journal on Software Tools for Technology Transfer, 1997
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993
- Solving Sequential Conditions by Finite-State StrategiesTransactions of the American Mathematical Society, 1969