Computation of Admissible Marking Sets in Weighted Synchronization-Free Petri Nets by Dynamic Programming
Ziyue Ma, Guanghui Zhu, Zhiwu Li, Alessandro Giua · IEEE Transactions on Automatic Control · 2019
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.