Alternating automata and program verification
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 471-485
- https://doi.org/10.1007/bfb0015261
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- The complexity of tree automata and logics of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Automata, tableaux, and temporal logicsPublished by Springer Nature ,1985
- Deciding branching time logicPublished by Association for Computing Machinery (ACM) ,1984
- AlternationJournal of the ACM, 1981
- On equations for regular languages, finite automata, and sequential networksTheoretical Computer Science, 1980
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974