CTL* and ECTL* as fragments of the modal μ-calculus
- 1 January 1992
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 145-164
- https://doi.org/10.1007/3-540-55251-0_8
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Computation tree logic and regular ω-languagesPublished by Springer Nature ,1989
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Deciding full branching time logicInformation and Control, 1984
- The temporal logic of branching timeActa Informatica, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- An exercise in proving parallel programs correctCommunications of the ACM, 1977
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966