Dense real-time games

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 167-176

  Faella, Marco ^a   La Torre, Salvatore ^a   Murano, Aniello ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FINITE AUTOMATA; PROBLEM SOLVING; REAL TIME SYSTEMS; THEOREM PROVING;

REAL-TIME GAMES;

GAME THEORY;

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

References (20)

1. Realizable and unrealizable specifications of reactive systems
2. Model-checking in dense real-time
3. A theory of timed automata
4. The benefits of relaxing punctuality
5. As soon as possible: Time optimal control for timed automata
6. Controller synthesis for timed automata
7. Using branching time temporal logic to synthesize synchronization skeletons
8. Automatic verification of finite-state concurrent systems using temporal-logic specifications
9. Computer-aided verification
10. Timed control synthesis for external specifications
11. Automata-theoretic decision of timed games
12. Propositional dynamic logic of regular programs
13. Rectangular hybrid games
14. Discrete-time control for rectangular hybrid automata
15. Module checking
16. A decidable dense branching-time temporal logic
17. Timed tree automata with an application to temporal logic
18. On the synthesis of a reactive module