On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net

Author(s):  
Roshanak Khaleghi ◽  
Ramavarapu S. Sreenivas
2013 ◽  
Vol 43 (5) ◽  
pp. 1256-1261 ◽  

We identify a class of partially controlled Petri net (PN) structures, which is denoted by G, that strictly includes the class of partially controlled free-choice (FC) PN structures. We show that there is a supervisory policy that enforces liveness in an arbitrary instance N(m0), where N ∈ G, if and only if there is a similar policy for an FCPN that results when the construction procedure enunciated in this paper is executed with N and its controllable transition set as input. Since the existence of a supervisory policy in an arbitrary partially controlled FCPN is decidable, it follows that the existence of similar policies for any N(m0), where N ∈ G, is also decidable. Furthermore, when it exists, the minimally restrictive supervisory policy that enforces in a member of G is characterized by a right-closed set of markings.


2010 ◽  
Vol 33 (5) ◽  
pp. 900-907 ◽  
Author(s):  
Li PAN ◽  
Zhi-Jun DING ◽  
Gang CHEN

Sign in / Sign up

Export Citation Format

Share Document