By Topic

On Petri net models of infinite state supervisors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. S. Sreenivas ; Dept. of Electr. Eng. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; B. H. Krogh

A class of supervisory control problems that require infinite state supervisors is considered, and Petri nets with inhibitor arcs (PNs) are introduced to model the supervisors. This PN-based approach to supervisory control is compared to automata-based approaches. The primary advantage of a PN-based supervisory controller is that it 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. It is shown 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

Published in:

IEEE Transactions on Automatic Control  (Volume:37 ,  Issue: 2 )