On a decidable class of partially controlled petri nets with liveness enforcing supervisory policies

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)1256-1261
Number of pages6
JournalIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Issue number5
StatePublished - 2013


  • Discrete event systems
  • Petri nets (PNs)
  • Supervisory control

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this