CTL* and ECTL* as fragments of the modal μ-calculus

Theoretical Computer Science

Volumn 126, Issue 1, 1994, Pages 77-96

  Dam, Mads ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; ERROR DETECTION; LOGIC PROGRAMMING;

AUTOMATED VERIFICATION METHOD; CTL; LINEAR TIME FRAGMENT; MODAL Μ-CALCULUS; PROGRAMMER; PROGRAMMING ERROR; TABLEAUX;

FORMAL LOGIC;

EID: 0028420232     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90269-0     Document Type: Article

References (34)

1. The temporal logic of branching time
2. Verifying temporal properties of processes
3. Automatic verification of sequential circuits using temporal logic
4. The formalization and analysis of a communications protocol
5. Design and synthesis of synchronisation skeletons using branching time temporal logic
6. A synthesis of two approaches for verifying finite state concurrent systems
7. Automatic verification of asynchronous circuits
8. Tableau-based model checking in the propositional mu-calculus
9. A semantics based verification tool for finite state systems
10. ∗ into the modal μ-calculus
11. “Sometimes” and “not never” revisited: on branching versus linear time
12. The complexity of tree automata and logics of programs
13. Efficient model checking in fragments of the propositional mu-calculus
14. Deciding full branching time logic
15. Propositional dynamic logic of regular programs
16. On the temporal analysis of fairness
17. An exercise in proving parallel programs correct
18. Algebraic laws for nondeterminism and concurrency
19. Results on the propositional μ-calculus
20. The glory of the past
21. Testing and generating infinite sequences by a finite automaton
22. Fixed points vs. infinite generation
23. Concurrency and automata on infinite sequences
24. Modal and temporal logics
25. Local model checking in the modal mu-calculus
26. Propositional dynamic logic of looping and converse is elementarily decidable
27. An automata theoretic decision procedure for the propositional mu-calculus
28. Star-free regular sets of ω-sequences
29. Computation tree logic and regular ω-languages
30. Yet another process logic
31. Automated analysis of mutual exclusion algorithms using CCS
32. P. Wolper, A translation from full branching time temporal logic to one letter propositional dynamic logic with looping, unpublished manuscript.
33. Temporal logic can be more expressive
34. Reasoning about infinite computation paths