Deterministic generators and games for Ltl fragments

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 291-299

  Alur, R ^a   La Torre, S ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; GAME THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MODAL ANALYSIS; PROGRAMMING THEORY; THEOREM PROVING;

DETERMINISTIC GAMES; DETERMINISTIC GENERATOR; LINEAR TEMPORAL LOGIC;

LOGIC PROGRAMMING;

EID: 0034858404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Automating modular verification
2. Alternating-time temporal logic
3. MOCHA: Modularity in model checking
4. Realizable and unrealizable specifications of reactive systems
5. The complexity of propositional linear temporal logics in simple cases
6. The complexity of tree automata and logics of programs
7. Temporal and modal logic
8. Module checking
9. Module checking revisited
10. Freedom, weakness, and determinism: From linear-time to branching-time
11. Checking that finite-state concurrent programs satisfy their linear specification
12. The temporal logic of programs
13. On the synthesis of a reactive module
14. Automata on infinite objects and church's problem
15. On the complexity of ω-automata
16. The complexity of propositional linear temporal logics
17. On the synthesis of strategies in infinite games
18. Verification of concurrent programs: The automata-theoretic framework
19. Reasoning about infinite computations