Abstract
Robustness of timed systems aims at studying whether infinitesimal perturbations in clock values can result in new discrete behaviors. A model is robust if the set of discrete behaviors is preserved under arbitrarily small (but positive) perturbations. We tackle this problem for Time Petri Nets (TPNs for short) by considering the model of parametric guard enlargement which allows time-intervals constraining the firing of transitions in TPNs to be enlarged by a (positive) parameter.
We show that TPNs are not robust in general and checking if they are robust with respect to standard properties (such as boundedness, safety) is undecidable. We then extend the marking class timed automaton construction for TPNs to a parametric setting, and prove that it is compatible with guard enlargements. We apply this result to the (undecidable) class of TPNs which are robustly bounded (i.e., whose finite set of reachable markings remains finite under infinitesimal perturbations): we provide two decidable robustly bounded subclasses, and show that one can effectively build a timed automaton which is timed bisimilar even in presence of perturbations. This allows us to apply existing results for timed automata to these TPNs and show further robustness properties.
This work was supported by the projects ANR ImpRo (ANR-2010-BLAN-0317) and ANR ECSPER (ANR-09-JCJC-0069)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183–235 (1994)
Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. in Software Engineering 17(3), 259–273 (1991)
Bouyer, P., Markey, N., Reynier, P.-A.: Robust Model-Checking of Linear-Time Properties in Timed Automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 238–249. Springer, Heidelberg (2006)
Bouyer, P., Markey, N., Reynier, P.-A.: Robust Analysis of Timed Automata via Channel Machines. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 157–171. Springer, Heidelberg (2008)
Bouyer, P., Markey, N., Sankur, O.: Robust Model-Checking of Timed Automata via Pumping in Channel Machines. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 97–112. Springer, Heidelberg (2011)
Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. Journal of Systems and Software 79(10), 1456–1468 (2006)
D’Aprile, D., Donatelli, S., Sangnier, A., Sproston, J.: From Time Petri Nets to Timed Automata: An Untimed Approach. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 216–230. Springer, Heidelberg (2007)
De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods in System Design 33(1-3), 45–84 (2008)
De Wulf, M., Doyen, L., Raskin, J.-F.: Systematic Implementation of Real-Time Models. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 139–156. Springer, Heidelberg (2005)
Gardey, G., Roux, O.H., Roux, O.F.: Using Zone Graph Method for Computing the State Space of a Time Petri Net. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 246–259. Springer, Heidelberg (2004)
Karp, R., Miller, R.: Parallel program chemata. JCSS 3, 147–195 (1969)
Lime, D., Roux, O.H.: Model checking of time petri nets using the state class timed automaton. Discrete Event Dynamic Systems 16(2), 179–205 (2006)
Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine, CA, USA (1974)
Puri, A.: Dynamical properties of timed automata. DEDS 10(1-2), 87–113 (2000)
Sankur, O.: Untimed Language Preservation in Timed Systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 556–567. Springer, Heidelberg (2011)
Swaminathan, M., Fränzle, M., Katoen, J.-P.: The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) TCS 2008. IFIP, vol. 273, pp. 537–553. Springer, Boston (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akshay, S., Hélouët, L., Jard, C., Reynier, PA. (2012). Robustness of Time Petri Nets under Guard Enlargement. In: Finkel, A., Leroux, J., Potapov, I. (eds) Reachability Problems. RP 2012. Lecture Notes in Computer Science, vol 7550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33512-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-33512-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33511-2
Online ISBN: 978-3-642-33512-9
eBook Packages: Computer ScienceComputer Science (R0)