Universality analysis for one-clock timed automata

Fundamenta Informaticae

Volumn 89, Issue 4, 2008, Pages 419-450

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

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; FINITE AUTOMATA; JAVA PROGRAMMING LANGUAGE; ROBOTS; SOFTWARE ENGINEERING; TRANSLATION (LANGUAGES);

EFFICIENT IMPLEMENTATIONS; FINITE WORDS; INFINITE WORDS; POST CONDITIONS; PROTOTYPE TOOLS; SINGLE CLOCKS; SUCCINCT REPRESENTATIONS; TIMED AUTOMATONS; UNIVERSALITY PROBLEMS;

AUTOMATA THEORY;

EID: 58149489143     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (38)

1. Abdulla, P. A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic Analysis of Programs with Well Quasi-Ordered Domains, Information and Computation, 160, 2000, 109-127.
2. nd International Colloquium on Automata, Languages, and Programming, 3580, 2005.
3. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, 4424, Springer Verlag, 2007.
4. Abdulla, P. A., Jonsson, B.: Undecidable Verification Problems for Programs with Unreliable Channels, Information and Computation, 130(1), 1996, 71-90.
5. Abdulla, P. A., Jonsson, B.: Verifying Programs with Unreliable Channels, Information and Computation, 127(2), 1996,91-101.
6. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (B. Steffen, Ed.), 1384, 1998.
7. th IEEE Int. Symp. on Logic in Computer Science, 2000.
8. Abdulla, P. A., Nylén, A.: Timed Petri Nets and BQOs, Proc. ICATPN'2001: 22nd Int. Conf. on application and theory of Petri nets, 2075, 2001.
9. Abdulla, P. A., Ouaknine, J., Quaas, K., Worrell, J.: Zone-Based Universality Analysis for Single-Clock Timed Automata, Proc. ofFSEN 2007, IPM International Symposium on Fundamentals of Software Engineering, 4767, 2007.
10. Alur, R., Dill, D.: A Theory of Timed Automata, Theoretical Computer Science, 126, 1994, 183-235.
11. Alur, R., Feder, T., Henzinger, T.: The Benefits of Relaxing Punctually, Journal of the ACM, 43, 1996, 116-146.
12. Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata, Theoretical Computer Science, 211, 1999, 253-273.
13. Alur, R., Henzinge, T.: Real-Time Logics: Complexity and Expressiveness, Information and Computation, 104(1), 1993, 35-77.
14. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey, 4th Intl. School on Formal Methods for Computer, Communication, and Software Systems: Real Time, 3185, 2004.
15. Alur, R., Torre, S. L., Madhusudan, P.: Perturbed Timed Automata, Proc. HSCC 05, 3414, 2005.
16. Bouyer, P.: Forward Analysis of Updatable Timed Automata, Formal Methods in System Design, 24(3), 2004, 281-320.
17. Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable Timed Automata, Theoretical Computer Science, 321(2-3), 2004, 291-345.
18. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The Cost of Punctuality, Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS '07), IEEE Computer Society Press, Wroclaw, Poland, July 2007.
19. Cécé, G., Finkel, A., Iyer, S. P.: Unreliable Channels Are Easier to Verify Than Perfect Channels, Information and Computation, 124(1), 10 January 1996, 20-31.
20. Cormen, T., Leiserson, C., Rivest, R., Stein, C: Introduction to Algorithms, MIT Press, McGraw-Hill, 2001.
21. Dill, D.: Timing Assumptions and Verification of Finite-State Concurrent Systems, Automatic Verification Methods for Finite-State Systems, 407, 1989.
22. Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere, Technical Report LSV-98-4, Ecole Normale Supérieure de Cachan, April 1998.
23. Henzinger, T., Manna, Z., Pnueli, A.: What Good are Digital Clocks?, Proc. ICALP '92, 623, 1992.
24. Henzinger, T. A., Kopke, P. W., Puri, A., Varaiya, P.: What's Decidable about Hybrid Automata?, J. Comput. Syst. Sci., 57(1), 1998, 94-124.
25. th Int. Conf. on Concurrency Theory, 3170, 2004.
26. Larsen, K., Pettersson, P., Yi, W.: UPPAAL in a Nutshell, Software Tools for Technology Transfer, 1(1-2), 1997.
27. Lasota, S., Walukiewicz, I.: Alternating Timed Automata, Proc. FOSSACS, 3441, 2005.
28. Lasota, S., Walukiewicz, I.: Alternating Timed Automata, ACM Trans, on Computational Logic, 2007, To appear.
29. Marcone, A.: Foundations of BQO Theory, Transactions of the American Mathematical Society, 345(2), 1994.
30. Mayr, R.: Undecidable Problems in Unreliable Computations, Theoretical Informatics (LATIN'2000), number 1776 in Lecture Notes in Computer Science, 2000.
31. Møller, J., Lichtenberg, J.: Difference Decision Diagrams, Master Thesis, Department of Information Technology, Technical University of Denmark, Building 344, DK-2800 Lyngby, Denmark, August 1998.
32. Niebert, P., Mahfoudh, M., Asarin, E., Bozga, M., Jain, N., Maler, O.: Verification of Timed Automata via Satisfiability Checking, FTRTFT'02, 7th Int. Symp. on Formal Techniques in Real-Time and Fault Tolerant Systems, 2469, 2002.
33. Ouaknine, J., Worrell, J.: Universality and Language Inclusion for Open and Closed Timed Automata, Proc. HSCC 03, 2623, 2003.
34. th IEEE Int. Symp. on Logic in Computer Science, 2004.
35. Ouaknine, J., Worrell, J.: On the decidability of Metric Temporal Logic, Proc. 19th Annual Symp. on Logic in Computer Science (LICS'05), IEEE Comp. Soc. Press, 2005.
36. Schnoebelen, Ph.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity, Information Processing Letters, 83(5), 2002, 251-261.
37. Thomson, B. S., Bruckner, J. B., Bruckner, A. M.: Elementary Real Analysis, Prentice Hall, 2001.
38. Yovine, S.: Kronos: A verification tool for real-time systems, Journal of Software Tools for Technology Transfer, 1(1-2), 1997.