ECM - Ecole Centrale de Marseille : UMR7279 (Pôle de l'étoile
Technopole de Château-Gombert
38 rue Frédéric Joliot-Curie
13013 Marseille, France - France)
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 behav-
iors 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.
https://hal.inria.fr/hal-01379431
Contributeur : Loic Helouet
<>
Soumis le : mardi 11 octobre 2016 - 15:01:43
Dernière modification le : mercredi 11 avril 2018 - 01:51:20
Sundararaman Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier. Robustness of Time Petri Nets under Guard Enlargement
. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2016, 143 (3-4). 〈hal-01379431〉
