We investigate reachability (or equivalently, safety) for timed systems modelled as Timed Automata (TA) under notions of “robustness”, i.e., when the clocks of the TA may drift by small amounts. Our contributions are two-fold: (1) We first consider the model of clock-drift introduced by Puri [1] and subsequently studied in other works [2,3,4]. We show that the standard zone-based forward reachability analysis performed by tools such as UPPAAL is in fact exact for TA with closed guards, invariants, and targets, when testing robust safety of timed systems having an arbitrary, but finite lifetime. (2) Next, we consider a more realistic model of drifting clocks that takes into account the regular resynchronization performed in most practical systems. We then show that the standard reachability analysis of tools like UPPAAL again suffices to test for robust safety in this model of clock-drift, for TA with closed guards, invariants, and targets, but now without any restrictions on system life-time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Puri, “Dynamical Properties of Timed Automata”, Discrete Event Dynamic Systems 10, Kluwer (2000), 87–113
M. de Wulf, L. Doyen, N. Markey, and J.-F. Raskin, “Robustness and Implementability of Timed Automata”, Proc. of FORMATS-FTRTFT’04, LNCS 3253, Springer (2004), 118-133
C. Daws and P. Kordy, “Symbolic Robustness Analysis of Timed Automata”, Proc. of FORMATS’06, LNCS 4202, Springer (2006), 143-155
C. Dima, “Dynamical Properties of Timed Automata Revisited”, Proc. of FORMATS’07, LNCS 4763, Springer (2007), 130–146
R. Alur and D. Dill, “A Theory of Timed Automata”, Theoretical Computer Science 126, Elsevier (1994), 183–235
G. Behrmann, A. David, and K. Larsen, “A Tutorial on Uppaal”, Formal Methods for the Design of Real-Time Systems, LNCS 3185, Springer-Verlag (2004), 200–236
M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, S. Yovine, “KRONOS: A Model-Checking Tool for Real-Time Systems”, Proc. of FTRTFT’98, LNCS 1486, Springer (1998), 298–302
M. Lindahl, P. Pettersson, and W. Yi, “Formal Design and Analysis of a Gear Controller”, International Journal on Software Tools for Technology Transfer 3, Springer-Verlag (2001), 353–368
L. Aceto, P. Bouyer, A. Burgueno, and K. Larsen, “The Power of Reachability Testing for Timed Automata”, Theoretical Computer Science 300, Elsevier (2003), 411-475
J. Bengtsson and W. Yi, “Timed Automata: Semantics, Algorithms, and Tools”, Lectures on Concurrency and Petri Nets, LNCS 3098, Springer (2004), 87–124
P. Bouyer, “Forward Analysis of Updatable Timed Automata”, Formal Methods in System Design 24, Kluwer (2004), 281–320
M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, “Automatic Verification of Real-time Systems with Discrete Probability Distributions”, Theoretical Computer Science 282, Elsevier (2002), 101-150
V. Gupta, T. A. Henzinger, and R. Jagadeesan, “Robust Timed Automata”, Proc. of HART’97, LNCS 1201, Springer (1997), 331–345
J. Ouaknine and J. Worrell, “Revisiting Digitization, Robustness, and Decidability for Timed Automata”, Proc. of LICS’03, IEEE CS Press (2003), 198-207
P. Bouyer, N. Markey, and P.-A. Reynier, “Robust Model-Checking of Linear-Time Properties in Timed Automata”, Proc. of LATIN’06, LNCS 3887, Springer (2006), 238–249.
P. Bouyer, N. Markey, and P.-A. Reynier, “Robust Analysis of Timed Automata via Channel Machines”, Proc. of FoSSaCS’08, LNCS 4962, Springer (2008), 157-171
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Swaminathan, M., Fränzle, M., Katoen, JP. (2008). The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_36
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)