On Petri Net Models of Infinite State Supervisors

R. S. Sreenivas, B. H. Krogh

Research output: Contribution to journalArticlepeer-review


We consider a class of supervisory control problems that require infinite state supervisors and introduce Petri nets with inhibitor arcs (PN's) to model the supervisors. We compare this PN-based approach to supervisory control to automata-based approaches. The primary advantage of a PN-based supervisory controller is that a PN-based controller provides a finite representation of an infinite state supervisor. For verification, implementation, and testing reasons, a finite PN-based representation of an infinite state supervisor is preferred over an automata-based supervisor. We show that this modeling advantage is accompanied by a decision disadvantage, in that in general the controllability of a language that can be generated by the closed-loop system is undecidable.

Original languageEnglish (US)
Pages (from-to)274-277
Number of pages4
JournalIEEE Transactions on Automatic Control
Issue number2
StatePublished - Feb 1992
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'On Petri Net Models of Infinite State Supervisors'. Together they form a unique fingerprint.

Cite this