Computation tree logic and regular ω-languages
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 690-713
- https://doi.org/10.1007/bfb0013041
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Temporal and Modal LogicPublished by Elsevier ,1990
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Reasoning about infinite computation pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Temporal logic can be more expressiveInformation and Control, 1983
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- On the temporal analysis of fairnessPublished by Association for Computing Machinery (ACM) ,1980
- Star-free regular sets of ω-sequencesInformation and Control, 1979
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971
- On finite monoids having only trivial subgroupsInformation and Control, 1965