Cart (Loading....) | Create Account
Close category search window
 

The existence of supervisory policies that enforce liveness in discrete event dynamic systems modeled by partially controlled Petri nets is undecidable

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
$31 $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

1 Author(s)
Sreenivas, R.S. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

We consider discrete-state plants represented by controlled Petri nets (CPN). A supervisory policy can be thought as an implicitly defined table that lists the transitions permitted to fire for each reachable marking. The set of transitions in a CPN is partitioned into controllable and uncontrollable transitions. Any transition in a CPN is state-enabled at a given marking if every input place to the said transition has a nonzero token-load. Similarly, a transition in a CPN is control-enabled at a given marking if the supervisory policy permits the firing of the said transition. Uncontrollable transitions are always control-enabled, while controllable transition can be control-disabled, if deemed necessary. The transition in a CPN has to be state-enabled and control-enabled to fire. A transition in a CPN is live if for every marking reachable under supervision, there exists a valid firing sequence that results in a marking under which the said transition is control-enabled and state-enabled. A supervisory policy enforces liveness if every transition in the CPN is live under supervision. In this paper we show that the existence of a supervisory policy that enforces liveness for an arbitrary CPN is undecidable

Published in:

Computer-Aided Control System Design, 1996., Proceedings of the 1996 IEEE International Symposium on

Date of Conference:

15-18 Sep 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.