Automata for modeling real-time systems

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

Volumn 443 LNCS, Issue , 1990, Pages 322-335

  Alur, Rajeev ^a   Dill, David ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS;

AUTOMATIC VERIFICATION; BOOLEAN OPERATIONS; FINITE STATE; MULLER AUTOMATA; TIMING DELAY; TRACE LANGUAGES;

REAL TIME SYSTEMS;

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

References (21)

1. S. Aggarwal, R.P. Kurshan, “Modeling elapsed time in protocol specification,” Protocol Specification, Testing and Verification, 3, 1983.
2. R. Alur, C. Courcoubetis, D.L. Dill, “Model-checking for real-time systems,” 5th IEEE LICS, 1990.
3. R. Alur, T.A. Henzinger, “Real-time logics: complexity and expressiveness,” 5th IEEE LICS, 1990.
4. J.R. Büchi, “On a decision method in restricted second-order arithmetic,” Proc. Internat. Congr. Logic, Methodology, and Philosophy of Science 1960, Stanford Univ. Press, 1962.
5. Y. Choueka, “Theories of automata on ω-tapes: a simplified approach,” JCSS 8, 1974.
6. E.M. Clarke, I.A. Draghicescu, R.P. Kurshan, “A unified approach for showing language containment and equivalence between various types of ω-automata,” Tech. report CMU-CS-89-192, Carnegie Mellon University, 1989.
7. E.M. Clarke, E.A. Emerson, A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,” ACM TOPLAS 8(2), 1986.
8. D.L. Dill, Trace Theory for Automatic Hierarchical Verification of Speed Independent Circuits, Ph.D. Thesis, Carnegie Mellon Univ., 1988.
9. D.L. Dill, “Timing assumptions and verification of finite-state concurrent systems,” Automatic Verification Methods for Finite State Systems, LNCS 407, 1989.
10. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.
11. J.E. Hopcroft, J.D. Ullman, Introduction to Automata theory, Languages and Computation, Addison-Wesley, 1979.
12. F. Jahanian, A.K. Mok, “Safety analysis of timing properties in real-time systems,” IEEE Trans. on Software engineering, 12(9), 1986.
13. R. Koymans, “Specifying message passing and time-critical systems with temporal logic,” Ph.D. Thesis, Eindhoven Univ. of Tech., 1989.
14. H.R. Lewis, “Finite-state analysis of asynchronous circuits with bounded temporal uncertainty,” Tech. Report TR-15-89, Harvard Univ., 1989.
15. H.R. Lewis, “A logic of concrete time intervals,” 5th IEEE LICS, 1990.
16. R. McNaughton, “Testing and generating infinite sequences by a finite automaton,” Information and Control 9, 1966.
17. A. Pnueli, “Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends,” Current Trends in Concurrency, LNCS 244, Springer-Verlag, 1986.
18. G.M. Reed, A.W. Roscoe, “A timed model for communicating sequential processes,” 13th ICALP, LNCS 226, Springer-Verlag, 1986.
19. S. Safra, “On the complexity of ω-automata,” 29th IEEE FOCS, 1988.
20. A.P. Sistla, M.Y. Vardi, P. Wolper, “The complementation problem for Büchi automata with applications to temporal logic,” Theoretical Computer Science 49, 1987.
21. P. Wolper, M.Y. Vardi, A.P. Sistla, “Reasoning about infinite computation paths,” 24th IEEE FOCS, 1983.