There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as Time Petri nets [3] or Timed Petri nets [4] do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in [1, 2] which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP?s using a state equation. Due to a lack of space, we only present our main results.
Citation:
Matthias Werner, Gero Muhl, "A State Equation for Petri Nets with Delaying Places," ecbs, pp.501-502, 13th Annual IEEE International Symposium and Workshop on Engineering of Computer Based Systems (ECBS'06), 2006