Skip to Main content Skip to Navigation

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.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Loic Helouet Connect in order to contact the contributor
Submitted on : Thursday, November 23, 2017 - 9:53:11 PM
Last modification on : Saturday, August 6, 2022 - 3:32:49 AM


Files produced by the author(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⟩



Record views


Files downloads