On the language inclusion problem for timed automata: Closing a decidability gap

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 54-63

  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

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY;

FINITE-STATE MACHINES; SEARCH ALGORITHMS; TIMED AUTOMATA;

FINITE AUTOMATA;

EID: 4544246903     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319600     Document Type: Conference Paper

References (30)

1. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In Proceedings of LICS 93, pages 160-670. IEEE Computer Society Press, 1993.
2. P. A. Abdulla and B. Jonsson. Verifying networks of timed processes. In Proceedings of TACAS 98, volume 1384, pages 298-312. Springer LNCS, 1998.
3. P. A. Abdulla, K. Čerans, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of LICS 96, pages 313-321. IEEE Computer Society Press, 1996.
4. 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.
5. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
6. R. Alur, L. Fix, and T. A. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
7. D. Bošnački. Digitization of timed automata. In Proceedings of FMICS 99, 1999.
8. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In Proceedings of ICSE 03, pages 385-395. IEEE Computer Society, 2003.
9. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
10. V. Gupta, T. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Proceedings of HART 97, volume 1201, pages 331-345. Springer LNCS, 1997.
11. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
12. 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.
13. 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.
14. P. Hermann. Timed automata and recognizability. Information Processing Letters, 65:313-318, 1998.
15. G. Higman. Ordering by divisibility in abstract algebras. In Proceedings of the London Mathematical Society, volume 2, pages 236-366, 1952.
16. J. E. Hopcroft and J. Ullman. Introduction to automata theory, languages and computation, Addison-Wesley, New York, NY, 1979.
17. Information Sciences Institute, University of Southern California. Transmission Control Protocol (DARPA Internet Program Protocol Specification), 1981. http://www.faqs.org/rfcs/rfc793.html.
18. D. K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. Timed I/O Automata: A mathematical framework for modeling and analyzing real-time systems. In Proceedings of KTSS 03. IEEE Computer Society Press, 2003.
19. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - A survey. In Proceedings of the IEEE, volume 84, pages 1090-1126, 1996.
20. N. A. Lynch and H. Attiya. Using mappings to prove timing properties. Distributed Computing, 6(2) 121-139, 1992.
21. J. Magee and J. Kramer. Concurrency: State Models and Java Programs. John Wiley, 1999.
22. J. Ouaknine. Digitisation and full abstraction for dense-time model checking. In Proceedings of TACAS 02, volume 2280, pages 37-51. Springer LNCS, 2002.
23. J. Ouaknine and J. B. Worrell. On the undecidability of universality for timed automata with minimal resources. In preparation.
24. J. Ouaknine and J. B. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In Proceedings of LICS 03, pages 198-207. IEEE Computer Society Press, 2003.
25. J. Ouaknine and J. B. Worrell. Timed CSP = closed timed ε-automata. Nordic Journal of Computing, 10:99-133, 2003.
26. J. Ouaknine and J. B. Worrell. Universality and language inclusion for open and closed timed automata. In Proceedings of HSCC 03, volume 2623, pages 375-388. Springer LNCS, 2003.
27. J.-F. Raskin. Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, University of Namur, 1999.
28. D. A. Spielman and Miklós Bóna. An infinite antichain of permutations. The Electronic Journal of Combinatorics, 7(2): 1-4, 2000.
29. S. Taşiran, R. Alur, R. P. Kurshan, and R. K. Brayton. Verifying abstractions of timed systems. In Proceedings of CONCUR 96, volume 1119, pages 546-562. Springer LNCS, 1996.
30. S. Tripakis. Folk theorems on the determinization and minimization of timed automata. In Proceedings of FORMATS 03, 2003.