Computation of Admissible Marking Sets in Weighted Synchronization-Free Petri Nets by Dynamic Programming | IEEE Journals & Magazine | IEEE Xplore

Computation of Admissible Marking Sets in Weighted Synchronization-Free Petri Nets by Dynamic Programming


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...Show More

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.
Published in: IEEE Transactions on Automatic Control ( Volume: 65, Issue: 6, June 2020)
Page(s): 2662 - 2669
Date of Publication: 19 September 2019

ISSN Information:

Funding Agency:


References

References is not available for this document.