On model checking for the μ-calculus and its fragments

Theoretical Computer Science

Volumn 258, Issue 1-2, 2001, Pages 491-522

  Emerson, E Allen ^a   Jutla, Charanjit S ^b   Sistla, A Prasad ^c  

^a University of Texas at Austin   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c 1120 Science and Engineering Offices   (United States)

Author keywords

calculus; Expressiveness; Model checking; Temporal logic; Tree automata

Indexed keywords

FINITE AUTOMATA; FORMAL LOGIC; THEOREM PROVING; TREES (MATHEMATICS);

IMFINITE BINARY TREES; TEMPORAL LOGIC;

MATHEMATICAL MODELS;

EID: 0034915972     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00034-7     Document Type: Article

References (19)

1. An automata theoretic approach to branching time modelchecking
2. Efficient local model checking for fragments of the modal μ-calculus
3. Tableux-based model checking in the propositional μ-calculus
4. A linear-time model checking for alternation free modal μ-calculus
5. Faster model checking for modal μ-calculus
6. Automata, tableaux, and temporal logics
7. Characterizing correctness properties of parallel programs using fixpoints
8. Tree automata, mu-calculus and determinacy
9. On model checking for fragments of the μ-calculus
10. Efficient model checking in fragments of the μ-calculus
11. Modalities for model checking
12. Deciding the winner in parity games is in UP ∩ co-UP
13. Results on the propositional μ-calculus
14. Regular Expressions for Infinite trees and a standard form of automata
15. Fixed-points vs. Infinite Generation
16. Local model checking in modal μ-calculus
17. An automata theoretic decision procedure for Propositional μ-calculus
18. Yet another process logic