Revisiting digitization, robustness, and decidability for timed automata

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 198-207

  Ouaknine, Joël ^a   Worrell, James ^b  

^a Carnegie Mellon University ^*  (United States)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALOG TO DIGITAL CONVERSION; COMPUTER PROGRAMMING LANGUAGES; RECURSIVE FUNCTIONS; SEMANTICS; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; CONTRACTS; INTERACTIVE COMPUTER SYSTEMS; INVERSE PROBLEMS; MATHEMATICAL TECHNIQUES; ROBUSTNESS (CONTROL SYSTEMS); TESTING;

INVERSE DIGITIZATION;

AUTOMATA THEORY; REAL TIME SYSTEMS;

ALGORITHM DESIGN AND ANALYSIS; AUTOMATA; DISCRETE-TIME THEORY; GOVERNMENT; LANGUAGE INCLUSION PROBLEMS; POSITIVE SIDES; ROBUST MODELING; TIMING;

EID: 0042969203     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of LICS 90, pages 414-425. IEEE Computer Society Press, 1990.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, L. Fix, and T. A. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
4. R. Alur and T. A. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceedings of FOCS 92, pages 177-186. IEEE Computer Society Press, 1992.
5. R. Alur and R. P. Kurshan. Timing analysis in COSPAN. In Proceedings of Hybrid Systems III, volume 1066, pages 220-231. Springer LNCS, 1996.
6. E. Asarin and A. Bouajjani. Perturbed Turing machines and hybrid systems. In Proceedings of LICS 01, pages 269-278. IEEE Computer Society Press, 2001.
7. E. Asarin, O. Maler, and A. Pnueli. On discretization of delays in timed automata and digital circuits. In Proceedings of CONCUR 98, volume 1466, pages 470-484. Springer LNCS, 1998.
8. A. Bouajjani, R. Echahed, and R. Robbana. Verifying invariance properties of timed systems with duration variables. In Proceedings of FTRTFT 94, volume 863, pages 193-210. Springer LNCS, 1994.
9. A. Bouajjani, R. Echahed, and J. Sifakis. On model checking for real-time properties with durations. In Proceedings of LICS 93. IEEE Computer Society Press, 1993.
10. D. Bošnački. Digitization of timed automata. In Proceedings of FMICS 99, 1999.
11. D. Bošnački and D. Dams. Integrating real time in spin: A prototype implementation. In Proceedings of FORTE/PSTV 98. pages 423-438. Kluwer, 1998.
12. E. M. Clarke and S. Campos. Real-time symbolic model checking for discrete time models. In AMAST Series in Computing: Theories and Experiences for Real-Time System Development. World Scientific, 1995.
13. M. Fränzle. Analysis of Hybrid Systems: An ounce of realism can save an infinity of states. In Proceedings of CSL 99, volume 1683, pages 126-140. Springer LNCS, 1999.
14. M. Fränzle. What will be eventually true of polynomial hybrid automata? In Proceedings of TACS 01, volume 2215, pages 340-359. Springer LNCS, 2001.
15. V. Gupta, T. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Proceedings of HART97, volume 1201, pages 331-345. Springer LNCS, 1997.
16. T. A. Henzinger. The theory of hybrid automata. In Proceedings of LICS 96. IEEE Computer Society Press, 1996.
17. T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proceedings of ICALP 92, volume 623, pages 545-558. Springer LNCS, 1992.
18. T. A. Henzinger and J.-F. Raskin. Robust undecidability of timed and hybrid systems. In Proceedings of HSCC 00, volume 1790, pages 145-159. Springer LNCS, 2000.
19. J. E. Hopcroft and J. Ullman. Introduction to automata theory, languages and computation. Addison-Wesley, New York, NY, 1979.
20. J. Ouaknine. Digitisation and full abstraction for dense-time model checking. In Proceedings of TACAS 02, volume 2280, pages 37-51. Springer LNCS, 2002.
21. J. Ouaknine and J. B. Worrell. Timed CSP = closed timed ε-automata. Nordic Journal of Computing (to appear), 2003.
22. J. Ouaknine and J. B. Worrell. Universality and language inclusion for open and closed timed automata. In Proceedings of HSCC 03 (to appear). Springer LNCS, 2003.
23. A. Puri. Dynamical properties of timed automata. In Proceedings of FTRTFT 98, volume 1486, pages 210-227. Springer LNCS, 1998.
24. A. Pun and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In Proceedings of CAV 94, volume 818, pages 95-104. Springer LNCS, 1994.
25. C. Bui Thanh, H. Klaudel, and F. Pommereau. Petri nets with causal time for system verification. In Proceedings of MTCS 02, ENTCS, 2002.