CTL∗ and ECTL∗ as fragments of the modal μ-calculus
- 11 April 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 126 (1) , 77-96
- https://doi.org/10.1016/0304-3975(94)90269-0
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- The complexity of tree automata and logics of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Automatic Verification of Sequential Circuits Using Temporal LogicIEEE Transactions on Computers, 1986
- “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 regular programsJournal of Computer and System Sciences, 1979
- An exercise in proving parallel programs correctCommunications of the ACM, 1977