The theory of timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 600 LNCS, Issue , 1992, Pages 45-73

  Alur, Rajeev ^a   Dill, David ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Automatic verification; Formal languages and automata theory; Real time systems

Indexed keywords

AUTOMATA THEORY; DECISION THEORY; FORMAL LANGUAGES; INTERACTIVE COMPUTER SYSTEMS;

AUTOMATIC VERIFICATION; DECISION PROBLEMS; FINITE STATE SYSTEMS; FORMAL LANGUAGE THEORY; FORMAL LANGUAGES AND AUTOMATA; REAL TIME REQUIREMENT; STATE-TRANSITION GRAPHS; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 85008257747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0031987     Document Type: Conference Paper

References (29)

1. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for realtime systems. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 414-425, 1990.
2. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for probabilistic real-time systems. In Automata, Languages and Programming: Proceedings of the 18th ICALP, Lecture Notes in Computer Science 510, 1991.
3. Rajeev Alur, Tomás Feder, and Thomas Henzinger. The benefits of relaxing punctuality. In Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 139-152, 1991.
4. Rajeev Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991.
5. J.R. Burch, E.M. Clarke, D.L. Dill, L.J. Hwang, and K. L. McMillan. Symbolic model checking: 102° states and beyond. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 428-439, 1990.
6. Richard Biichi. On a decision method in restricted second-order arithmetic. In Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science 1960, pages 1-12. Stanford University Press, 1962.
7. E.M. Clarke, I.A. Draghicescu, and R.P. Kurshan. A unified approach for showing language containment and equivalence between various types of ω-automata. Technical report, Carnegie Mellon University, 1989.
8. Edmund Clarke, E. Allen Emerson, and A. Prasad Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
9. Yaacov Choueka. Theories of automata on ω-tapes: a simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
10. Costas Courcoubetis and Mihalis Yannakakis. Minimum and maximum delay problems in real-time systems. In Proceedings of the Third Workshop on Computer-Aided Verification, Aalborg University, Denmark, 1991.
11. David Dill and Howard Wong-Toi. Synthesizing processes and schedulers from temporal specifications. In Proceedings of the Second Workshop on Computer-Aided Verification, Rutgers University, 1990.
12. E. Allen Emerson and Edmund M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
13. Patrice Godefroid and Pierre Wolper. A partial approach to model-checking. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, pages 406-415, 1991.
14. C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666-677, 1978.
15. John Hopcroft and Jeff Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
16. Robert Kurshan. Complementing deterministic Biichi automata in polynomial time. Journal of Computer and System Sciences, 35:59-71, 1987.
17. Leslie Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress, pages 657-668. Elsevier Science Publishers, 1983.
18. Robert McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
19. Zohar Manna and Amir Pnueli. The temporal framework for concurrent programs. In R.S. Boyer and J.S. Moore, editors, The correctness problem in Computer science, pages 215-274. Academic Press, 1981.
20. Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-77, 1977.
21. Amir Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. In Current Trends in Concurrency, Lecture Notes in Computer Science 224, pages 510-584. Springer-Verlag, 1986.
22. Hartley Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
23. Shmuel Safra. On the complexity of ω-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 319-327, 1988.
24. A. Prasad Sistla, Moshe Vardi, and Pierre Wolper. The complementation problem for Buchi automata with applications to temporal logic. Theoretical Computer Science, 49, 1987.
25. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier Science Publishers, 1990.
26. Moshe Vardi. Verification of concurrent programs - the automata-theoretic framework. In Proceedings of the Second IEEE Symposium on Logic in Computer Science, pages 167-176, 1987.
27. Moshe Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First IEEE Symposium on Logic in Computer Science, pages 332-344, 1986.
28. Howard Wong-Toi and Girard Hoffmann. The control of dense real-time discrete event systems. 1991.
29. Pierre Wolper, Moshe Vardi, and A. Prasad Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 185-194, 1983.