Timed automata and the theory of real numbers

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

Volumn 1664 LNCS, Issue , 1999, Pages 242-257

  Comon, Hubert ^a   Jurski, Yan ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; COMPUTABILITY AND DECIDABILITY; MODEL CHECKING;

CONTROL STATE; COUNTER AUTOMATA; INTERMEDIATE RESULTS; NESTED LOOPS; REACHABILITY RELATIONS; THEORY OF INTEGERS; TIMED AUTOMATA; TIMED TEMPORAL LOGIC;

AUTOMATA THEORY;

EID: 84888234004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_18     Document Type: Conference Paper

References (19)

1. R. Alur. Timed automata. In Verification of Digital and Hybrid Systems, Proc. NATO-ASI Summer School, Antalya, Turkey, 1997. To appear.
2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real time. Information and Computation, 104(1):2-24, 1993.
3. R. Alur, C. Courcoubetis, and T. Henzinger. Computing accumulated delays in real-time systems. In Proc. 5th Conf. on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 181-193. Springer-Verlag, 1993.
4. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. 17th Int. Coll. on Automata, Languages and Programming, Warwick, LNCS 443, pages 322-335. Springer-Verlag, 1990.
5. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
6. R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuallity. J. ACM, 43:116-146, 1996.
7. R. Alur and T. Henzinger. A really temporal logic. J. ACM, 41:181-204, 1994.
8. R. alur, T. Henzinger, and M. Vardi. Parametric real-time reasoning. In Proc. 25th Annual ACM Symposium on Theory of Computing, 1993.
9. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Computer Aided Verification, Proc. 6th Int. Conerence, LNCS, Stanford, June 1994. Springer-Verlag.
10. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In A. Hu and M. Vardi, editors, Proc. Computer Aided Verification, volume 1427 of LNCS, pages 268-279, Vancouver, 1998. Springer-Verlag.
11. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. Technical report, LSV Research Report, June 1999. avalaible at http://www.lsv.ens-cachan.fr/Publis/publis-lsv-index.html.
12. C. Courcoubetis and M. Yannakakis. Minimal and maximal delay problems in real time systems. In K. Larsen and A. Skou, editors, Proc. CAV 91: Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 399-409. Springer-Verlag, 1991.
13. L. Fribourg. A closed form evaluation for extending timed automata. Technical Report 1998-02, Laboratoire Spécification et Vérification, ENS Cachan, Mar. 1998.
14. T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What is decidable about hybrid automata ? In Proc. 27th Symposium on Theory of Computing, pages 373-382. ACM Press, 1995.
15. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real time systems. Information and Computation, 111(2):193-244, 1994.
16. F. Laroussinie, K. Larsen, and C. Weise. From timed automata to logic - and back. In Proc. 20th Conf. on Foundations of Computer Science, volume 969 of Lecture Notes in Computer Science, Prag, 1995. Springer-Verlag.
17. M. Lothaire. Combinatorics on words, volume 17 of Encyclopedia of mathematics and its applications. Cambridge University Press, 1982.
18. F. Wang. Timing behaviour analysis for real time systems. In Tenth Annual IEEE Symposium on Logic in Computer Science, San Diego, CA, June 1995. IEEE Comp. Soc. Press.
19. T. Wilke and M. Dickhfer. The automata-theoretic method works for tctl model checking. Technical Report 9811, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1998.