Abstract
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 E 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 withN 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 E 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.
Original language | English (US) |
---|---|
Pages (from-to) | 1256-1261 |
Number of pages | 6 |
Journal | IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans |
Volume | 43 |
Issue number | 5 |
DOIs | |
State | Published - 2013 |
Keywords
- Discrete event systems
- Petri nets (PNs)
- Supervisory control
ASJC Scopus subject areas
- Software
- Information Systems
- Human-Computer Interaction
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Computer Science Applications