Decidable approximations on generalized and parameterized discrete timed automata

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

Volumn 2108, Issue , 2001, Pages 529-539

  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

CLOCKS; COMBINATORIAL MATHEMATICS; COMPUTABILITY AND DECIDABILITY; PARAMETERIZATION;

APPROXIMATION TECHNIQUES; CLOCK CONSTRAINTS; LINEAR RELATION; PARAMETERIZED; REACHABILITY; SAFETY ANALYSIS; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 23044530461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_59     Document Type: Conference Paper

References (29)

1. R. Alur, “Timed automata”, CAV’99, LNCS 1633, pp. 8-22
2. R. Alur, C. Courcoubetis and D. Dill, “Model-checking in dense real time,” Information and Computation, 104 (1993) 2-34
3. R. Alur and D. Dill, “A theory of timed automata,” TCS, 126 (1994) 183-236
4. R. Alur, T. A. Henzinger, “A really temporal logic,” J. ACM, 41 (1994) 181-204
5. R. Alur, T. A. Henzinger and M. Y. Vardi, “Parametric real-time reasoning,” STOC’93, pp. 592-601
6. A. Coen-Porisini, C. Ghezzi and R. A. Kemmerer, “Specification of real-time systems using ASTRAL,” TSE, 23 (1997) 572-598
7. H. Comon and Y. Jurski, “Timed automata and the theory of real numbers,” CONCUR’99, LNCS 1664, pp. 242-257
8. A. Coen-Porisini, R. A. Kemmerer and D. Mandrioli, “A formal framework for ASTRAL intralevel proof obligations,” TSE, 20 (1994) 548-561
9. Z. Dang, “A decidable binary reachability characterization of timed pushdown automata with dense clocks,” To appear in CAV’01, LNCS
10. Z. Dang and R. A. Kemmerer, “Using the ASTRAL model checker to analyze Mobile IP,” ICSE’99, pp. 132-141
11. Z. Dang and R. A. Kemmerer, “A symbolic model checker for testing ASTRAL real-time specifications,” RTCSA’99, pp. 174-181
12. Z. Dang and R. A. Kemmerer, “Using the ASTRAL symbolic model checker as a specification debugger: three approximation techniques,” ICSE’00, pp. 345-354
13. Z. Dang, O. H. Ibarra and R. A. Kemmerer, http://www.eecs.wsu.edu/∼zdang, the full version of this paper
14. Z. Dang, P. San Pietro and R. A. Kemmerer, “On Presburger liveness of discrete timed automata,” STACS’01, LNCS 2010, pp. 132-143
15. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer and J. Su, “Binary reachability analysis of discrete pushdown timed automata,” CAV’00, LNCS 1855, pp. 69-84
16. T. A. Henzinger and Pei-Hsin Ho, “HyTech: the Cornell hybrid technology tool,” Hybrid Systems II, LNCS 999, 1995, pp. 265-294
17. T. A. Henzinger, X. Nicollin, J. Sifakis and S. Yovine. “Symbolic model checking for real-time systems,” Information and Computation, 111 (1994) 193-244
18. C. Heitmeyer and N. Lynch, “The generalized railroad crossing: a case study in formal verification of real-time systems,” RTSS’94, pp. 120-131
19. O. H. Ibarra, “Reversal-bounded multicounter machines and their decision problems,” J. ACM, 25 (1978) 116-133
20. O. H. Ibarra, T. Jiang, N. Tran and H. Wang, “New decidability results concerning two-way counter machines,” SIAM J. Comput., 24 (1995) 123-137
21. O. H. Ibarra, J. Su, Z. Dang, T. Bultan and R. A. Kemmerer, “Counter machines: decidable properties and applications to verification problems,”, MFCS’00, LNCS 1893, pp. 426-435
22. P. Kolano, “Tools and techniques for the design and systematic analysis of real- Time systems,” Ph.D. Thesis, University of California, Santa Barbara, 1999
23. P. Z. Kolano, Z. Dang and R. A. Kemmerer, “The design and analysis of realtime systems using the ASTRAL software development environment,” Annals of Software Engineering, 7 (1999) 177-210
24. K. G. Larsen, P. Pattersson and W. Yi, “UPPAAL in a nutshell,” International Journal on Software Tools for Technology Transfer, 1 (1997) 134-152
25. F. Laroussinie, K. G. Larsen and C. Weise, “From timed automata to logic - and back,” MFCS’95, LNCS 969, pp. 529-539
26. W. Pugh, “The Omega test: a fast and practical integer programming algorithm for dependence analysis,” CACM, 8 (1992) 102-104
27. J. Raskin and P. Schobben, “State clock logic: a decidable real-time logic,” HART’97, LNCS 1201, pp. 33-47
28. T. Wilke, “Specifying timed state sequences in powerful decidable logics and timed automata,” LNCS 863, pp. 694-715, 1994
29. S. Yovine, “A verification tool for real-time systems,” International Journal on Software Tools for Technology Transfer, 1 (1997): 123-133