Decision Problems for Timed Automata: A Survey

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

Volumn 3185, Issue , 2004, Pages 1-24

  Alur, Rajeev ^a   Madhusudan, P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EQUIVALENCE CLASSES; INTERACTIVE COMPUTER SYSTEMS; REAL TIME SYSTEMS; ROBOTS; SURVEYS;

COMMUNICATION AND CONTROL; DECISION PROBLEMS; EXPLICIT MODELING; FORMAL MODELING AND VERIFICATION; FORMAL NOTATIONS; TIMED AUTOMATA; TIMED LANGUAGES; VERIFICATION ALGORITHMS;

MODELING LANGUAGES;

EID: 35048817380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30080-9_1     Document Type: Article

References (37)

1. R. Alur, C. Courcoubetis, and T. Henzinger. The observational power of clocks. In CONCUR '94: Fifth International Conference on Concurrency Theory, LNCS 836, pages 162-177. Springer-Verlag, 1994.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, 1996.
4. R. Alur, L. Fix, and T. Henzinger. Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
5. A preliminary version appears in Proc. CAV'94, LNCS 818, pp. 1-13.
6. R. Alur and T. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 177-186, 1992.
7. R. Alur and R. Kurshan. Timing analysis in COSPAN. In Hybrid Systems III: Control and Verification, LNCS 1066, pages 220-231. Springer-Verlag, 1996.
8. R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. In Hybrid Systems: Computation and Control, Fourth International Workshop, LNCS 2034, pages 49-62, 2001.
9. G. Behrman, T. Hune, A. Fehnker, K. Larsen, P. Petersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Hybrid Systems: Computation and Control, Fourth International Workshop, LNCS 2034, pages 147-161, 2001.
10. B. Bérard and C. Dufourd. Timed automata and additive clock constraints. Information Processing Letters, 75(1-2):1-7, 2000.
11. B. Berard, P. Gastin, and A. Petit. On the power of non-obervable actions in timed automata. In Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1046, pages 257-268, 1996.
12. P. Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3):281-320, 2004.
13. P. Bouyer, E. Brinksma, and K. Larsen. Staying alive as cheaply as possible. In Proc. 7th Int. Workshop on Hybrid Systems: Computation and Control (HSCC 2004), LNCS 2993, pages 203-218. Springer, 2004.
14. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In Computer Aided Verification, 14th International Conference, LNCS 2404, pages 464-479, 2000.
15. F. Cassez, T. Henzinger, and J. Raskin. A comparison of control problems for timed and hybrid systems. In Hybrid Systems: Computation and Control, Fifth International Workshop, LNCS 2289, pages 134-148, 2002.
16. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proceedings of the Third Workshop on Computer-Aided Verification, LNCS 575, pages 399-409. Springer-Verlag, 1991.
17. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In Hybrid Systems III: Verification and Control, LNCS 1066, pages 208-219. Springer-Verlag, 1996.
18. M. De Wulf, L. Doyen, N. Markey, and J. Raskin. Robustness and implementability of timed automata. In Proc. FORMATS, 2004.
19. D. D'Souza. A logical characterisation of event recording automata. In Proc. 6th Int. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'00), LNCS 1926, pages 240-251. Springer, 2000.
20. D. D'Souza and P. Madhusudan. Timed control synthesis for external specifications. In Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, LNCS 2285, pages 571-582. Springer, 2002.
21. V. Gupta, T. Henzinger, and R. Jagadeesan. Robust timed automata. In Hybrid and Real Time Systems: International Workshop (HART'97), LNCS 1201, pages 48-62. Springer, 1997.
22. T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata. Journal of Computer and System Sciences, 57:94-124, 1998.
23. T. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In ICALP 92: Automata, Languages, and Programming, LNCS 623, pages 545-558. Springer-Verlag, 1992.
24. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
25. T. Henzinger and J. Raskin. Robust undecidability of timed and hybrid systems. In Hybrid Systems: Computation and Control, Third International Workshop, LNCS 1790, pages 145-159, 2000.
26. T. Henzinger, J. Raskin, and P. Schobbens. The regular real-time languages. In ICALP'98: Automata, Languages, and Programming, LNCS 1443, pages 580-593. 1998.
27. P. Herrmann. Timed automata and recognizability. Information Processing Letters, 65(6):313-318, 1998.
28. S. La Torre, S. Mukhopadhyay, and R. Alur. Subclasses of timed automata with NP-complete reachability problem. Technical report, 2003. Unpublished.
29. F. Laroussinie, N. Markey, and P. Schnoebelen. Model checking timed automata with one or two clocks. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR 2004). Springer, 2004.
30. K. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Springer International Journal of Software Tools for Technology Transfer, 1, 1997.
31. J. Miller. Decidability and complexity results for timed automata and semi-linear hybrid automata. In Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control (HSCC 2000), LNCS 1790, pages 296-309. Springer, 2000.
32. J. Ouaknine and J. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, 2003.
33. J. Ouaknine and J. Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science, 2004.
34. A. Puri. Dynamical properties of timed automata. In Proceedings of the 5th International Symposium on Formal Techniques in Real Time and Fault Tolerant Systems, LNCS 1486, pages 210-227, 1998.
35. J. Raskin and P. Schobbens. The logic of event clocks - decidability, complexity, and expressiveness. Journal of Automata, Languages, and Combinatorics, 4(3):247-286, 1999.
36. S. Tripakis. Folk theorems on determinization and minimization of timed automata. In Proc. FORMATS, 2003.
37. F. Wang. Efficient data structures for fully symbolic verification of real-time software systems. In TACAS '00: Sixth International Conference on Tools and Algorithms for the Construction and Analysis of Software, LNCS 1785, pages 157-171, 2000.