Characterization of Admissible Marking Sets in Petri Nets with Uncontrollable Transitions
Document Type
Article
Publication Date
7-1-2016
Abstract
This work studies the equivalent transformation from a legal marking set to its admissible marking set. First, the concepts of escaping-marking set and transforming marking set are defined, and two algorithms are provided to compute the transforming marking set and the admissible marking set. Second, the equivalent transformation of a disjunction of linear constraints expressed in terms of generalized mutual exclusion constraints (GMECs) with non-negative weights via uncontrollable transitions is established.
Identifier
84977134167 (Scopus)
Publication Title
IEEE Transactions on Automatic Control
External Full Text Location
https://doi.org/10.1109/TAC.2015.2480233
ISSN
00189286
First Page
1953
Last Page
1958
Issue
7
Volume
61
Grant
CX201411010
Fund Ref
Zhejiang Gongshang University
Recommended Citation
Wang, Shouguang; You, Dan; Zhou, Meng Chu; and Seatzu, Carla, "Characterization of Admissible Marking Sets in Petri Nets with Uncontrollable Transitions" (2016). Faculty Publications. 10426.
https://digitalcommons.njit.edu/fac_pubs/10426
