Combining Free choice and Time in Petri Nets

Abstract : Time Petri nets (TPNs) are a classical extension of Petri nets with timing constraints attached to transitions , for which most verification problems are undecidable. We consider TPNs under a strong semantics with multiple enablings of transitions. We focus on a structural subclass of unbounded TPNs, where the underlying untimed net is free choice, and show that it enjoys nice properties in the timed setting under a multi-server semantics. In particular, we show that the questions of firability (whether a chosen transition can fire), and termination (whether the net has a non-terminating run) are decidable for this class. Next, we consider the problem of robustness under guard enlargement and guard shrinking, i.e., whether a given property is preserved even if the system is implemented on an architecture with imprecise time measurement. For unbounded free choice TPNs with a multi-server semantics, we show decidability of robustness of firability and of termination under both guard enlargement and shrinking.
Type de document :
[Research Report] INRIA Rennes - Bretagne Atlantique. 2017
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
Contributeur : Loic Helouet <>
Soumis le : jeudi 23 novembre 2017 - 21:53:11
Dernière modification le : jeudi 7 février 2019 - 17:57:13


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01646913, version 1


S Akshay, Loïc Hélouët, Ramchandra Phawade. Combining Free choice and Time in Petri Nets. [Research Report] INRIA Rennes - Bretagne Atlantique. 2017. 〈hal-01646913〉



Consultations de la notice


Téléchargements de fichiers