Abstract
We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a control state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Since a timed automaton can be treated as a PTA without the pushdown stack, we can show that the binary reachability of a timed automaton is definable in the additive theory of reals and integers. The results can be used to verify a class of properties containing linear relations over both dense variables and unbounded discrete variables. The properties previously could not be verified using the classic region technique nor expressed by timed temporal logics for timed automata and CTL* for pushdown systems.
Chapter PDF
Similar content being viewed by others
References
R. Alur, “Timed automata”, CAV’99, LNCS 1633, pp. 8–22
R. Alur, C. Courcoibetis, and D. Dill, “Model-checking in dense real time,” Information and Computation, 104 (1993) 2–34
R. Alur and D. Dill, “A theory of timed automata,” Theoretical Computer Science, 126 (1994) 183–236
R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” J. ACM, 43 (1996) 116–146
R. Alur, T. A. Henzinger, “Real-time logics: complexity and expressiveness,” Information and Computation, 104 (1993) 35–77
R. Alur, T. A. Henzinger, “A really temporal logic,” J. ACM, 41 (1994) 181–204
A. Bouajjani, J. Esparza, and O. Maler, “Reachability Analysis of Pushdown Automata: Application to Model-Checking,”, CONCUR’97, LNCS 1243, pp. 135–150
A. Bouajjani, R. Echahed, and R. Robbana, “On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures,” Hybrid System II, LNCS 999, 1995, pp. 64–85
T. Ball and S. K. Rajamani, “Bebop: A Symbolic Model-checker for Boolean Programs,” Spin Workshop’00, LNCS 1885, pp. 113–130.
B. Boigelot, S. Rassart and P. Wolper, “On the expressiveness of real and integer arithmetic automata,” ICALP’98, LNCS 1443, pp. 152–163
A. Coen-Porisini, C. Ghezzi and R. Kemmerer, “Specification of real-time systems using ASTRAL,” IEEE Transactions on Software Engineering, 23 (1997) 572–598
H. Comon and Y. Jurski, “Multiple counters automata, safety analysis and Presburger arithmetic,” CAV’98, LNCS 1427, pp. 268–279.
H. Comon and Y. Jurski, “Timed Automata and the Theory of Real Numbers,” CONCUR’99, LNCS 1664, pp. 242–257
Z. Dang, http://www.eecs.wsu.edu/zdang, the full version of this paper
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
Z. Dang, O. H. Ibarra and R. A. Kemmerer, “Decidable Approximations on Generalized and Parameterized Discrete Timed Automata,” COCOON’01, LNCS (to appear)
Z. Dang, P. San Pietro and R. A. Kemmerer, “On Presburger Liveness of Discrete Timed Automata,” STACS’01, LNCS 2010, pp. 132–143
A. Finkel, B. Willems and P. Wolper, “A direct symbolic approach to model checking pushdown systems,” INFINITY’97.
E. Gurari and O. Ibarra, “The Complexity of Decision Problems for Finite-TurnMulticounter Machines,’ J. Computer and System Sciences, 22 (1981) 220–229
T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,” ICALP’92, LNCS 623, pp. 545–558
T. A. Henzinger and Pei-Hsin Ho, “HyTech: the Cornell hybrid technology tool,” Hybrid Systems II, LNCS 999, pp. 265–294
T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. “Symbolic Model Checking for Realtime Systems,” Information and Computation, 111 (1994) 193–244
O. H. Ibarra, “Reversal-bounded multicounter machines and their decision problems,” J. ACM, 25 (1978) 116–133
K. G. Larsen, P. Pattersson, and W. Yi, “UPPAAL in a nutshell,” International Journal on Software Tools for Technology Transfer, 1 (1997): 134–152
F. Laroussinie, K. G. Larsen, and C. Weise, “From timed automata to logic — and back,” MFCS’95, LNCS 969, pp. 529–539
J. Raskin and P. Schobben, “State clock logic: a decidable real-time logic,” HART’97, LNCS 1201, pp. 33–47
T. Wilke, “Specifying timed state sequences in powerful decidable logics and timed automata,” LNCS 863, pp. 694–715, 1994
S. Yovine, “A verification tool for real-time systems,” International Journal on Software Tools for Technology Transfer, 1 (1997): 123–133
S. Yovine, “Model checking timed automata,” Embedded Systems’98, LNCS 1494, pp. 114–152
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, Z. (2001). Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. In: Berry, G., Comon, H., Finkel, A. (eds) Computer Aided Verification. CAV 2001. Lecture Notes in Computer Science, vol 2102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44585-4_48
Download citation
DOI: https://doi.org/10.1007/3-540-44585-4_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42345-4
Online ISBN: 978-3-540-44585-2
eBook Packages: Springer Book Archive