Decidability and complexity results for timed automata via channel machines

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1089-1101

  Abdulla, Parosh Aziz ^a   Deneux, Johann ^a   Ouaknine, Joël ^b   Worrell, James ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING;

CHANNEL MACHINES; LANGUAGE INCLUSION PROBLEM; NON-PRIMITIVE RECURSIVE COMPLEXITY; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 26644455517     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_88     Document Type: Conference Paper

References (22)

1. P. Abdulla and B. Jonsson. Undecidable Verification Problems with Unreliable Channels. Information and Computation 130:71-90, 1996.
2. P. Abdulla and B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science 290(1):241-264, 2003.
3. R. Alur and D. Dill. A Theory of Timed Automata. Theoretical Computer Science 126:183-235, 1994.
4. R. Alur, T. Feder and T. A. Henzinger. The Benefits of Relaxing Punctually. Journal of the ACM 43:116-146, 1996.
5. R. Alur, L. Fix and T. A. Henzinger. Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science 211(1-2):253-273, 1999.
6. R. Alur and T. A. Henzinger. Real-time Logics: Complexity and Expressiveness. Information and Computation 104:35-77, 1993.
7. R. Alur, S. La Torre and P. Madhusudan. Perturbed Timed Automata. Proc. HSCC 05, LNCS 3414, Springer-Verlag, 2005.
8. R. Alur and P. Madhusudan. Decision problems for timed automata: A survey, 4th Intl. School on Formal Methods for Computer, Communication, and Software Systems: Real Time, LNCS 3185, Springer-Verlag, 2004.
9. P. Bouyer, C. Dufourd, E. Fleury and A. Petit. Updatable timed automata. Theoretical Computer Science 321(2-3):291-345, 2004.
10. G. Cécé, A. Finkel and S. Purushothaman Iyer. Unreliable Channels are Easier to Verify Than Perfect Channels. Information and Computation 124:20-31, 1996.
11. A. Finkel and P. Schnoebelen. Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2):63-92, 2001.
12. T. A. Henzinger, P.W. Kopke, A. Puri and P. Varaiya. What's Decidable About Hybrid Automata? Journal of Computer and System Sciences 57:94-124, 1998.
13. T. A. Henzinger, Z. Manna, and A. Pnueli. What Good Are Digital Clocks? Proc. ICALP 92, LNCS 623, Springer-Verlag, 1992.
14. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
15. F. Laroussinie, N. Markey and P. Schnoebelen. Model Checking Timed Automata with One or Two Clocks. Proc. CONCUR 04, LNCS 3170, Springer-Verlag, 2004.
16. S. Lasota and I. Walukiewicz. Alternating Timed Automata. Proc. of FOSSACS 05, LNCS 3441, Springer-Verlag, 2005.
17. S. Lasota and I. Walukiewicz. Personal communication, 2005.
18. R. Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science 1-3(297):337-354, 2003.
19. J. Ouaknine and J. Worrell. Universality and Language Inclusion for Open and Closed Timed Automata. Proc. HSCC O3, LNCS 2623, Springer-Verlag, 2003.
20. J. Ouaknine and J. Worrell. On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. Proc. LICS 04, IEEE, 2004.
21. J. Ouaknine and J. Worrell. On the Decidability of Metric Temporal Logic. Proc. LICS 05, IEEE, 2005.
22. P. Schnoebelen. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters 83(5):251-261, 2002.