Efficient local model-checking for fragments of the modal Μ-calculus
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 107-126
- https://doi.org/10.1007/3-540-61042-1_41
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955