Temporal logic with forgettable past

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 383-392

  Laroussinie, François ^a   Markey, Nicolas ^a   Schnoebelen, Philippe ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGICS;

ALGORITHMS; AUTOMATION; BOOLEAN ALGEBRA; DECISION THEORY; DYNAMIC PROGRAMMING; FINITE AUTOMATA; POLYNOMIALS; SEMANTICS;

FORMAL LOGIC;

EID: 0036044742     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2002.1029846     Document Type: Conference Paper

References (27)

1. Systems and Software Verification
2. The complexity of propositional linear temporal logics in simple cases
3. Temporal and modal logic
4. First order logic with two variables and unary temporal logic
5. The declarative past and imperative future: Executable temporal logic for interactive systems
6. On the temporal analysis of fairness
7. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
8. Process logic with regular formulas
9. A decision algorithm for full propositional temporal logic
10. Extended temporal logic revisited
11. Once and for all
12. A hierarchy of temporal logics with past
13. Specification in CTL+Past for verification in CTL
14. The glory of the past
15. Alternating finite automata on omega-words
16. A choppy logic
17. The complexity of propositional linear temporal logics
18. The complementation problem for Büchi automata with applications to temporal logic
19. An automata-theoretic approach to automatic program verification
20. A temporal fixpoint calculus
21. Alternating automata and program verification
22. Reasoning about the past with two-way automata
23. Classifying discrete temporal properties