Computation of admissible marking sets in weighted synchronization-free petri nets by dynamic programming

Ma Z.;Zhu G.;Li Z.;Giua A.

2020-01-01

---

Abstract

We study the computation of admissible marking sets in generalized Petri nets. We first show that the admissibility checking in the generalized Petri net is NP-hard. Then, we consider a special subclass of generalized Petri nets called weighted-synchronization-free nets in which each transition has at most one input place. For a net in this subclass, we propose a generating function to compute by dynamic programming the set of admissible markings for a given generalized mutual exclusion constraint.