A Classification of Symbolic Transition Systems
- 24 March 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Minimal model generationPublished by Springer Nature ,2005
- General decidability theorems for infinite-state systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The theory of hybrid automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- Verifying networks of timed processesPublished by Springer Nature ,1998
- Automatic symbolic verification of embedded systemsIEEE Transactions on Software Engineering, 1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Hybrid automata with finite bisimulationsPublished by Springer Nature ,1995
- CTL∗ and ECTL∗ as fragments of the modal μ-calculusTheoretical Computer Science, 1994
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993