An improved algorithm for the evaluation of fixpoint expressions
- 1 January 1994
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 338-350
- https://doi.org/10.1007/3-540-58179-0_66
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- Model checking and boolean graphsLecture Notes in Computer Science, 1992
- Local model checking in the modal mu-calculusTheoretical Computer Science, 1991
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- A unified approach for showing language containment and equivalence between various types of ω-automataLecture Notes in Computer Science, 1990
- A note on model checking the modal v-calculusPublished by Springer Science and Business Media LLC ,1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955