Past pushdown timed automata and safety verification

Theoretical Computer Science

Volumn 313, Issue 1, 2004, Pages 57-71

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

^a WASHINGTON STATE UNIVERSITY   (United States)

^b University of California   (United States)

Author keywords

Automated verification; Past formulas; Presburger arithmetic; Temporal logic; Timed automata

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SOFTWARE; DIGITAL ARITHMETIC; FORMAL LOGIC;

PRESBURGER ARITHMETIC; TEMPORAL LOGIC; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 0742285805     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.004     Document Type: Conference Paper

References (18)

1. R. Alur, Timed automata, in: Computer Aided Verification (CAV'99), Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, 1999, pp. 8-22.
2. Alur R., Dill D.L. A theory of timed automata. Theoret. Comput. Sci. 126(2):1994;183-235.
3. Alur R., Henzinger T.A. A really temporal logic. J. Assoc. Comput. Mach. 41(1):1994;181-204.
4. A. Bouajjani, R. Echahed, R. Robbana, On the automatic verification of systems with continuous variables and unbounded discrete data structures, in: Hybrid Systems II, Lecture Notes in Computer Science, Vol. 999, Springer, Berlin, 1995, pp. 64-85.
5. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model-checking, in: Concurrency (CONCUR'97), Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 135-150.
6. Coen-Porisini A., Ghezzi C., Kemmerer R.A. Specification of realtime systems using ASTRAL. IEEE Trans. Software Eng. 23(9):1997;572-598.
7. H. Comon, Y. Jurski, Timed automata and the theory of real numbers, in: Concurrency (CONCUR'99), Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 242-257.
8. Zhe Dang, Binary reachability analysis of pushdown timed automata with dense clocks, in: Computer Aided Verification (CAV'01), Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, 2001, pp. 506-517.
9. Zhe Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, in: Computer Aided Verification (CAV'00), Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 69-84.
10. Zhe Dang, R.A. Kemmerer, Three approximation techniques for astral symbolic model checking of infinite state real-time systems, in: Proc. of the 22nd Internat. Conf. on Software Engineering, ACM Press, New York, 2000, pp. 345-354.
11. C. Heitmeyer, N.A. Lynch, The generalized railroad crossing - a case study in formal verification of real-time systems, in: Proc. 15th IEEE Real-Time Systems Symp., IEEE Computer Society Press, Los Alamitos, 1994, pp. 120-131.
12. Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. ACM. 25(1):1978;116-133.
13. Ibarra O.H., Su J., Dang Zhe, Bultan T., Kemmerer R.A. Counter machines and verification problems. Theoret. Comput. Sci. 289(1):2002;165-189.
14. P.Z. Kolano, Tools and techniques for the design and systematic analysis of real-time systems, Ph.D. dissertation, Department of Computer Science, University of California at Santa Barbara, 1999.
15. Kolano P.Z., Dang Zhe, Kemmerer R.A. The design and analysis of real-time systems using the ASTRAL Software Development Environment. Ann. Software Eng. 7:1999;177-210.
16. A. Pnueli, The temporal logic of programs, in: Proc. of the 18th IEEE Symp. on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1977, pp. 46-57.
17. Straubing H. Finite Automata, Formal Logic, and Circuit Complexity. 1994;Birkhauser, Boston.
18. W. Thomas, Auotmata on infinite objects, in: Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B.V., Amsterdam, 1990, pp. 133-191.