The regular real-time languages

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

Volumn 1443 LNCS, Issue , 1998, Pages 580-591

  Henzinger, T A ^a   Raskin, J F ^b   Schobbens, P Y ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CLOCKS; COMPUTER CIRCUITS; FINITE AUTOMATA; INTERACTIVE COMPUTER SYSTEMS; SPECIFICATIONS; TEMPORAL LOGIC;

BOOLEAN OPERATIONS; MEASURE DISTANCE; REAL-TIME LANGUAGES; SATISFIABILITY PROBLEMS; SECOND-ORDER EXTENSION; SEQUENTIAL CALCULUS; TEMPORAL OPERATORS; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

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

References (16)

1. E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. In Proc. 12th IEEE Symp. Logic in Computer Science, pp. 160-171, 1997.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 120:183-235, 1994.
3. K. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed automata. In Computer-aided Verification, LNCS 818:1-13. Springer-Verlag, 1994.
4. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43:116-146, 1996.
5. R. Alur and T.A. Henzinger. Back to the future: towards a theory of timed regular languages. In Proc. 33rd IEEE Symp. Foundations of Computer Science, pp. 177-186, 1992.
6. R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104:35-77, 1993.
7. R. Alur and T.A. Henzinger. A really temporal logic. J. ACM, 41:181-204, 1994.
8. J.R. Biichi. On a decision method in restricted second-order arithmetic. In Proc. First Congress on Logic, Methodology, and Philosophy of Science (1960), pp. 1-11. Stanford University Press, 1962.
9. D. Gabbay, A. Pnucli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Principles of Programming Languages, pp. 163-473, 1980.
10. J.A.W. Kamp. Taute Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles, 1968.
11. J.-F. Raskin and P.-Y. Schobbens. State clock logic: a decidable real-time logic. In Hybrid and Real-time Systems, LNCS 1201:33-47. Springer-Verlag, 1997.
12. A.P. Sistla. Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University, 1983.
13. L.J. Stockmeyer. The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, Massachusetts Institute of Technology, 1974.
14. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-time and Fault-tolerant Systems, LNCS 863:694-715. Springer-Verlag, 1994.
15. P.L. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.
16. P.L. Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symp. Foundations of Computer Science, pp. 185-194, 1983.