Pushdown timed automata: A binary reachability characterization and safety verification

Theoretical Computer Science

Volumn 302, Issue 1-3, 2003, Pages 93-121

  Dang, Zhe ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Binary reachability; Model checking; Presburger; Pushdown timed automata; Real time systems; Timed automata

Indexed keywords

COMPUTER SCIENCE; INTEGER PROGRAMMING; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

PUSHDOWN TIMED AUTOMATA (PTA);

AUTOMATA THEORY;

EID: 0037563164     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00743-0     Document Type: Article

References (36)

1. R. Alur, Timed automata, CAV'99, Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, 1999, pp. 8-22.
2. Alur R., Courcoibetis C., Dill D. Model-checking in dense real time. Inform. Comput. 104:1993;2-34.
3. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126:1994;183-236.
4. Alur R., Feder T., Henzinger T.A. The benefits of relaxing punctuality. J. ACM. 43:1996;116-146.
5. Alur R., Henzinger T.A. Real-time logics. complexity and expressiveness Inform. Comput. 104:1993;35-77.
6. Alur R., Henzinger T.A. A really temporal logic. J. ACM. 41:1994;181-204.
7. Ball T., Rajamani S.K. Bebop: a symbolic model-checker for Boolean programs. Spin Workshop'00. Lecture Notes in Computer Science. Vol. 1885:2000;113-130 Springer, Berlin.
8. Buchi J.R. On a decision method in restricted second order arithmetic. Proc. Internat. Congress on Logic, Method, and Philosophy of Sciences. 1962;1-12 Stanford University Press, Stanford, CA.
9. Boigelot B., Rassart S., Wolper P. On the expressiveness of real and integer arithmetic automata. ICALP'98. Lecture Notes in Computer Science. Vol. 1443:1998;152-163 Springer, Berlin.
10. Bouajjani A., Echahed R., Robbana R. On the automatic verification of systems with continuous variables and unbounded discrete data structures. Antsaklis P.J., Kohn W., Nerode A., Sastry S. Hybrid System II. Lecture Notes in Computer Science. Vol. 999:1995;64-85 Springer, Berlin.
11. Bouajjani A., Esparza J., Maler O. Reachability Analysis of Pushdown Automata. Application to Model-Checking, CONCUR'97 Lecture Notes in Computer Science. Vol. 1243:1997;135-150 Springer, Berlin.
12. Bozga M., Daws C., Maler O., Olivero A., Tripakis S., Yovine S. Kronos: A model-checking tool for real-time systems. CAV'98. Lecture Notes in Computer Science. Vol. 1427:1998;546-550 Springer, Berlin.
13. Cherubini A., Breveglieri L., Citrini C., Crespi Reghizzi S. Multi-push-down languages and grammars. Internat. J. Foundations Comput. Sci. 7(3):1996;253-291.
14. Coen-Porisini A., Ghezzi C., Kemmerer R. Specification of real-time systems using ASTRAL. IEEE Trans. Software Eng. 23:1997;572-598.
15. Comon H., Cortier V. Flatness is not a weakness. CSL'00. Lecture Notes in Computer Science. Vol. 1862:2000;262-276 Springer, Berlin.
16. Comon H., Jurski Y. Multiple counters automata, safety analysis and Presburger arithmetic. CAV'98. Lecture Notes in Computer Science. Vol. 1427:1998;268-279 Springer, Berlin.
17. Comon H., Jurski Y. Timed automata and the theory of real numbers, CONCUR'99. Lecture Notes in Computer Science. Vol. 1664:1999;242-257 Springer, Berlin.
18. Z. Dang, Debugging and verification of infinite state real-time systems, Ph.D. Dissertation, University of California, Santa Barbara, August 2000.
19. Dang Z. Binary reachability analysis of pushdown timed automata with dense clocks. CAV'01. Lecture Notes in Computer Science. Vol. 2102:2001;506-517 Springer, Berlin.
20. Dang Z., Ibarra O.H., Bultan T., Kemmerer R.A., Su J. Binary reachability analysis of discrete pushdown timed automata. CAV'00. Lecture Notes in Computer Science. Vol. 1855:2000;69-84 Springer, Berlin.
21. Dang Z., Ibarra O.H., Kemmerer R.A. Decidable approximations on generalized and parameterized discrete timed automata. COCOON'01. Lecture Notes in Computer Science. Vol. 2108:2001;529-539 Springer, Berlin.
22. Dang Z., San Pietro P., Kemmerer R.A. On Presburger liveness of discrete timed automata. STACS'01. Lecture Notes in Computer Science. Vol. 2010:2001;132-143 Springer, Berlin.
23. Esparza J., Schwoon S. A BDD-based model-checker for recursive programs. CAV'01. Lecture Notes in Computer Science. Vol. 2102:2001;324-336 Springer, Berlin.
24. A. Finkel, B. Willems, P. Wolper, A direct symbolic approach to model checking pushdown systems, Electronic Notes in Theoretical Computer Science, Vol. 9, Elsevier, Amsterdam, 2000.
25. Gurari E., Ibarra O. The complexity of decision problems for finite-turn multicounter machines. J. Comput. System Sci. 22:1981;220-229.
26. Henzinger T.A., Nicollin X., Sifakis J., Yovine S. Symbolic model checking for real-time systems. Inform. Comput. 111:1994;193-244.
27. Henzinger T.A., Pei-Hsin Ho HyTech: the Cornell hybrid technology tool. Antsaklis P.J., Kohn W., Nerode A., Sastry S. Hybrid Systems II. Lecture Notes in Computer Science. Vol. 999:1995;265-294 Springer, Berlin.
28. Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. ACM. 25:1978;116-133.
29. Ibarra O.H., Jiang T., Tran N., Wang H. New decidability results concerning two-way counter machines. SIAM J. Comput. 24:1995;123-137.
30. Laroussinie F., Larsen K.G., Weise C. From timed automata to logic - and back. MFCS'95. Lecture Notes in Computer Science. Vol. 969:1995;529-539 Springer, Berlin.
31. K.G. Larsen, G. Behrmann, Ed Brinksma, A. Fehnker, T. Hune, P. Pettersson, J. Romijn, As cheap as possible: efficient cost-optimal reachability for priced timed automata, CAV'01, Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, 2001, pp. 493-505.
32. Larsen K.G., Pattersson P., Yi W. UPPAAL in a nutshell. Internat. J. Software Tools Technol. Transfer. 1:1997;134-152.
33. Minsky M.L. Computation: Finite and Infinite Machines. 1967;Prentice-Hall, Englewood Cliffs, NJ.
34. Raskin J., Schobben P. State clock logic: a decidable real-time logic. HART'97. Lecture Notes in Computer Science. Vol. 1201:1997;33-47 Springer, Berlin.
35. T. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, Lecture Notes in Computer Science, Vol. 863, Springer, Berlin, 1994, pp. 694-715.
36. Yovine S. Model checking timed automata. Rozenberg G., Vaandrager F.W. Embedded Systems'98. Lecture Notes in Computer Science. Vol. 1494:1998;114-152 Springer, Berlin.