Referenced Items are not available for this document.
This paper considers supervisory control of probabilistic discrete event systems (PDESs). PDESs are modeled as generators of probabilistic languages. The supervisory control problem considered is to find, if possible, a supervisor under whose control the behavior of a plant is identical to a given probabilistic specification. The probabilistic supervisors we employ are a generalization of the deterministic ones previously employed in the literature. At any state, the supervisor enables/disables events with certain probabilities. Necessary and sufficient conditions for the existence of such a supervisor, and an algorithm for its computation are presented.
Published in:
Automatic Control, IEEE Transactions on
(Volume:54
,
Issue:
8
)
Date of Publication: Aug. 2009
- Page(s):
- 2013 - 2018
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 10805992
- Digital Object Identifier :
- 10.1109/TAC.2009.2024376
- Product Type:
- Journals & Magazines
- Date of Publication :
- 28 July 2009
- Date of Current Version :
- 04 August 2009
- Issue Date :
- Aug. 2009
- Sponsored by :
- IEEE Control Systems Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
