Generalized discrete timed automata: Decidable approximations for safety verification

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 59-74

  Dang, Zhe ^a   Ibarra, Oscar H ^b   Kemmerer, Richard A ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER DEBUGGING; PROBLEM SOLVING; REAL TIME SYSTEMS;

SAFETY VERIFICATION;

AUTOMATA THEORY;

EID: 0037265185     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00432-2     Document Type: Conference Paper

References (28)

1. R. Alur, Timed automata, CAV'99, Lecture Notes in Computer Science, vol. 1633, Springer, Berlin, pp. 8-22.
2. Alur R., Courcoubetis 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., Henzinger T.A. A really temporal logic. J. Assoc. Comput. Mach. 41:1994;181-204.
5. R. Alur, T.A. Henzinger, M.Y. Vardi, Parametric real-time reasoning, STOC'93, ACM Press, New York, pp. 592-601.
6. Coen-Porisini A., Ghezzi C., Kemmerer R.A. Specification of real-time systems using ASTRAL. IEEE Tran. Soft. Eng. 23:1997;572-598.
7. Coen-Porisini A., Kemmerer R.A., Mandrioli D. A formal framework for ASTRAL intralevel proof obligations. IEEE Tran. Soft. Eng. 20:1994;548-561.
8. H. Comon, Y. Jurski, Timed automata and the theory of real numbers, CONCUR'99, Lecture Notes in Computer Science, vol. 1664, Springer, Berlin, pp. 242-257.
9. Z. Dang, Binary reachability analysis of timed pushdown automata with dense clocks, CAV'01, Lecture Notes in Computer Science, vol. 2102, Springer, Berlin, pp. 506-517.
10. Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, CAV'00, Lecture Notes in Computer Science, vol. 1855, Springer, Berlin, pp. 69-84.
11. Z. Dang, R.A. Kemmerer, Using the ASTRAL model checker to analyze Mobile IP, ICSE'99, ACM Press, New York, pp. 132-141.
12. Z. Dang, R.A. Kemmerer, A symbolic model checker for testing ASTRAL real-time specifications, RTCSA'99, IEEE Computer Society, Los Alamitos, pp. 174-181.
13. Z. Dang, R.A. Kemmerer, Using the ASTRAL symbolic model checker as a specification debugger: three approximation techniques, ICSE'00, ACM Press, New York, pp. 345-354.
14. Z. Dang, P. San Pietro, R.A. Kemmerer, On Presburger liveness of discrete timed automata, STACS'01, Lecture Notes in Computer Science, vol. 2010, Springer, Berlin, pp. 132-143.
15. C. Heitmeyer, N. Lynch, The generalized railroad crossing: a case study in formal verification of real-time systems, RTSS'94, pp. 120-131.
16. Henzinger T.A., Ho P.-H. HyTech. the Cornell hybrid technology tool, Hybrid Systems II, Lecture Notes in Computer Science vol. 999:1995;265-294 Springer, Berlin.
17. Henzinger T.A., Nicollin X., Sifakis J., Yovine S. Symbolic model checking for real-time systems. Inform. Comput. 111:1994;193-244.
18. Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25:1978;116-133.
19. Ibarra O.H., Jiang T., Tran N., Wang H. New decidability results concerning two-way counter machines. SIAM J. Comput. 24:1995;123-137.
20. O.H. Ibarra, J. Su, Z. Dang, T. Bultan, R.A. Kemmerer, Counter machines: decidable properties and applications to verification problems, MFCS'00, Lecture Notes in Computer Science, vol. 1893, Springer, Berlin, pp. 426-435.
21. P. Kolano, Tools and techniques for the design and systematic analysis of real-time systems, Ph.D. Thesis, University of California, Santa Barbara, 1999.
22. Kolano P.Z., Dang Z., Kemmerer R.A. The design and analysis of real-time systems using the ASTRAL software development environment. Ann. Software Eng. 7:1999;177-210.
23. F. Laroussinie, K.G. Larsen, C. Weise, From timed automata to logic - and back, MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, pp. 529-539.
24. Larsen K.G., Pattersson P., Yi W. UPPAAL in a nutshell. Internat. J. Software Tools Tech. Transfer. 1:1997;134-152.
25. Pugh W. The Omega test. a fast and practical integer programming algorithm for dependence analysis Comm. Assoc. Comput. Mach. 8:1992;102-104.
26. J. Raskin, P. Schobben, State clock logic: a decidable real-time logic, HART'97, Lecture Notes in Computer Science, vol. 1201, Springer, Berlin, pp. 33-47.
27. Wilke T. Specifying timed state sequences in powerful decidable logics and timed automata, Lecture Notes in Computer Science. vol. 863:1994;694-715 Springer, Berlin.
28. Yovine S. A verification tool for real-time systems. Internat. J. Software Tools Tech. Transfer. 1:1997;123-133.