A theory of timed automata

Theoretical Computer Science

Volumn 126, Issue 2, 1994, Pages 183-235

  Alur, Rajeev ^a   Dill, David L ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; FINITE AUTOMATA; REAL TIME SYSTEMS;

DETERMINISTIC AUTOMATA; MULLER AUTOMATA;

AUTOMATA THEORY;

EID: 0028413052     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90010-8     Document Type: Article

References (48)

1. Model-checking for real-time systems
2. Model-checking for probabilistic real-time systems
3. Verifying automata specifications of probabilistic real-time systems
4. The benefits of relaxing punctuality
5. A really temporal logic
6. Proving real-time properties of programs with temporal logic
7. On a decision method in restricted second-order arithmetic
8. 20 states and beyond
9. Theories of automata on ω-tapes: a simplified approach
10. A unified approach for showing language containment and equivalence between various types of ω-automata
11. Automatic verification of finite-state concurrent systems using temporal-logic specifications
12. Minimum and maximum delay problems in real-time systems
13. Timing assumptions and verification of finite-state concurrent systems
14. Synthesizing processes and schedulers from temporal specifications
15. Using branching-time temporal logic to synthesize synchronization skeletons
16. Quantitative temporal reasoning
17. A partial approach to model-checking
18. Explicit-clock temporal logic
19. Propositional dynamic logic of regular programs
20. Temporal proof methodologies for real-time systems
21. Communicating sequential processes
22. Safety analysis of timing properties in real-time systems
23. A graph-theoretic approach for timing analysis and its implementation
24. Specifying real-time properties with metric temporal logic
25. Complementing deterministic Büchi automata in polynomial time
26. What good is temporal logic?
27. Analyzing safety and fault tolerance using timed Petri nets
28. Finite-state analysis of asynchronous circuits with bounded temporal uncertainty
29. Using mappings to prove timing properties
30. The temporal framework for concurrent programs
31. Testing and generating infinite sequences by a finite automaton
32. From ATP to timed graphs and hybrid systems
33. The temporal logic of programs
34. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends
35. Analysis of asynchronous concurrent systems by Petri nets
36. On the complexity of ω-automata
37. The complementation problem for Büchi automata with applications to temporal logic
38. Automata on infinite objects
39. Verification of concurrent programs–the automata-theoretic framework
40. An automata-theoretic approach to automatic program verification
41. Temporal logic can be more expressive
42. The control of dense real-time discrete event systems
43. Reasoning about infinite computation paths