Combining Free choice and Time in Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logical and Algebraic Methods in Programming Year : 2020

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-enabling 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-enabling semantics, we show decidability of robustness of firability and of termination under both guard enlargement and shrinking.
Fichier principal
Vignette du fichier
Lamp.pdf (587.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01931728 , version 1 (22-11-2018)

Identifiers

Cite

Sundararaman Akshay, Loïc Hélouët, Ramchandra Phawade. Combining Free choice and Time in Petri Nets. Journal of Logical and Algebraic Methods in Programming, 2020, pp.1-36. ⟨10.1016/j.jlamp.2018.11.006⟩. ⟨hal-01931728⟩
81 View
148 Download

Altmetric

Share

Gmail Facebook X LinkedIn More