Modalities for model checking: branching time logic strikes back

Science of Computer Programming

Volumn 8, Issue 3, 1987, Pages 275-306

  Allen Emerson, E ^a   Lei, Chin Laung ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA; COMPUTER METATHEORY - FORMAL LOGIC;

AUTOMATIC VERIFICATION; BRANCHING TIME LOGIC; FINITE STATE CONCURRENT PROGRAMS; GLOBAL STATE GRAPH; MODEL CHECKING;

COMPUTER PROGRAMMING;

EID: 0023362541     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(87)90036-0     Document Type: Article

References (37)

1. Decidability and expressiveness of logics of processes
2. Tools and studies of formal techniques—Petri nets and temporal logic
3. A note on reliable full-duplex transmission over half-duplex links
4. Design and synthesis of synchronization skeletons using branching time temporal logic
5. Automatic verification of finite state concurrent systems using temporal logic
6. Automatic verification of asynchronous circuits
7. Characterizing correctness properties of parallel programs as fixpoints
8. Using branching time temporal logic to synthesize synchronization skeletons
9. Decision procedures and expressiveness in the temporal logic of branching time
10. ‘Sometimes’ and ‘not never’ revisited: On branching versus linear time temporal logic
11. Deciding full branching time logic
12. Propositional dynamic logic of regular programs
13. Generalized fair termination
14. A general result on infinite trees and its applications
15. Probabilistic temporal logics for finite and bounded models
16. ‘Sometimes’ is sometimes ‘not never’,—on the temporal logic of programs
17. Impartiality, justice and fairness: The ethics of concurrent termination
18. Checking that finite state concurrent programs satisfy their linear specification
19. Testing and generating infinite sequences by a finite automaton
20. Infinite sequences and finite machines
21. Proving liveness properties of concurrent programs
22. On the semantics of fair parallelism
23. The temporal logic of programs
24. On the extremely fair termination of probabilistic algorithms
25. Linear and branching structures in the semantics and logics of reactive systems
26. Semantical considerations on Floyd-Hoare logic
27. A dedicable Mu-calculus
28. Fairness and related properties in transition systems
29. Decidability of second order theories and automata on infinite trees
30. Automata on infinite trees and the synthesis problem
31. The complexity of propositional linear temporal logic
32. Propositional dynamic logic of looping and converse
33. The propositional Mu-calculus is elementary
34. Depth-first search and linear graph algorithms
35. Automata theoretic techniques of modal logics of programs