Robustness of Time Petri Nets under Guard Enlargement

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.
Type de document :
Communication dans un congrès
Alain Finkel and Jérôme Leroux and Igor Potapov. Reachability Problems, Sep 2012, Bordeaux, France. Springer, 7550, pp.92-106, 2012
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00879832
Contributeur : Loic Helouet <>
Soumis le : mardi 5 novembre 2013 - 12:14:46
Dernière modification le : mercredi 16 mai 2018 - 11:24:06
Document(s) archivé(s) le : jeudi 6 février 2014 - 04:34:44

Fichier

RP12_robustTPN.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00879832, version 1

Citation

Sundararaman Akshay, Loic Helouet, Claude Jard, Pierre-Alain Reynier. Robustness of Time Petri Nets under Guard Enlargement. Alain Finkel and Jérôme Leroux and Igor Potapov. Reachability Problems, Sep 2012, Bordeaux, France. Springer, 7550, pp.92-106, 2012. 〈hal-00879832〉

Partager

Métriques

Consultations de la notice

1943

Téléchargements de fichiers

141