Model checking the full modal mu-calculus for infinite sequential processes
- 1 June 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 221 (1-2) , 251-270
- https://doi.org/10.1016/s0304-3975(99)00034-1
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- Results on the propositional μ-calculusTheoretical Computer Science, 1983