Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Timed Petri Nets with (restricted) Urgency

Abstract : Time Petri Nets (TPN) [Mer74] and Timed Petri Nets [Wal83] are two incomparable classes of concurrent models with timing constraints: urgency cannot be expressed using Timed Petri Nets, while TPNs can only keep track of a bounded number of continuous values ("clocks"). We introduce Timed Petri Nets with Urgency, extending Timed Petri Nets with the main features of TPNs. We present upto-our-knowledge the first decidability results for Petri Net vari-ants combining time, urgency and unbounded places. First, we obtain decidability of control-state reachability for the subclass of Timed Petri Nets with Urgency where urgency constraints can only be used on bounded places. By restricting this class to use a finite number of "clocks", we further show decidability of (marking) reachability. Formally, this class corresponds to TPNs under a new, yet natural, timed semantics where urgency constraints are restricted to bounded places. Fur-ther, under their original semantics, we obtain the decidability of reachability for a more restricted class of TPNs. TPNs
keyword : Petri nets
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Loic Helouet Connect in order to contact the contributor
Submitted on : Saturday, November 29, 2014 - 9:54:15 PM
Last modification on : Wednesday, February 2, 2022 - 3:50:49 PM
Long-term archiving on: : Friday, April 14, 2017 - 11:41:20 PM


Files produced by the author(s)


  • HAL Id : hal-01088997, version 1


Sundararaman Akshay, Blaise Genest, Loïc Hélouët. Timed Petri Nets with (restricted) Urgency. 2014. ⟨hal-01088997⟩



Record views


Files downloads