Decidable Classes of Unbounded Petri Nets with Time and Urgency

Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [ 22 ] are intractable except in a bounded setting. On the other hand, the model of Timed-Arc Petri nets [ 26 ] enjoys decidability results for boundedness and control-state reachability problems at the cost of disallowing urgency (the ability to enforce actions within a time delay). Our goal is to investigate decidable classes of Petri nets with time that capture some urgency and still allow unbounded behaviors, which go beyond finite state systems. We present, up to our knowledge, the first decidability results on reachability and boundedness for Petri net variants that combine unbounded places, time, and urgency. For this, we introduce the class of Timed-Arc Petri nets with restricted Urgency, where urgency can be used only on transitions consuming tokens from bounded places. We show that control-state reachability and boundedness are decidable for this new class, by extending results from Timed-Arc Petri nets (without urgency) [ 2 ]. Our main result concerns (marking) reachability, which is undecidable for both TPNs (because of unrestricted urgency) [ 20 ] and Timed-Arc Petri Nets (because of infinite number of “clocks”) [ 25 ]. We obtain decidability of reachability for unbounded TPNs with restricted urgency under a new, yet natural, timed-arc semantics presenting them as Timed-Arc Petri Nets with restricted urgency. Decidability of reachability under the intermediate marking semantics is also obtained for a restricted subclass. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.