An automata-theoretic approach to linear temporal logic
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 238-266
- https://doi.org/10.1007/3-540-60915-6_6
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- On simultaneously determinizing and complementing omega -automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- 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
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Automata, tableaux, and temporal logicsLecture Notes in Computer Science, 1985
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- 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
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969