Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science

Volumn 59, Issue 1-2, 1988, Pages 115-131

  Browne, M C ^a   Clarke, E M ^a   Grumberg O ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

BRANCHING TIME LOGIC; BRANCHING TIME OPERATORS; FINITE KRIPKE STRUCTURES; PROPOSITIONAL TEMPORAL LOGIC;

COMPUTER METATHEORY;

EID: 0024035719     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(88)90098-9     Document Type: Article

References (22)

1. A linear algorithm to solve fixed-point equations on graphs
2. The temporal logic of branching time
3. Automatic verification of sequential circuits using temporal logic
4. Design and synthesis of synchronization skeletons using branching time temporal logic
5. Automatic verification of finite-state concurrent systems using temporal logic specifications
6. “Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic
7. Deciding full branching-time logic
8. From synchronization tree logic to acceptance model logic
9. On observing nondeterminism and concurrency
10. The power of the future perfect in program logics
11. “Sometimes” is sometimes “Not Never”
12. What good is temporal logic?
13. Checking that finite state concurrent programs satisfy their linear specification
14. A Calculus of Communicating Systems
15. Hierarchical verification of asynchronous circuits using temporal logic
16. Synthesis of communicating processes from temporal logic specifications
17. Linear and branching structures in the semantics and logics of reactive systems
18. Specification and verification of concurrent systems in CESAR
19. Complexity of propositional linear temporal logics
20. An automata-theoretic approach to automatic program verification
21. Specification and synthesis of communicating processes using an extended temporal logic