Abstract:
This paper considers optimal supervisory control of probabilistic discrete event systems (PDESs). PDESs are modeled as generators of probabilistic languages. The probabilistic supervisors employed enable/disable events with certain probabilities. We consider the case when there exists no probabilistic supervisor to match the behaviour of a plant to a probabilistic requirements specification. First, we define a notion of distance between two probabilistic generators. Then, given a plant and a desired probabilistic behaviour, we present an algorithm that minimizes the distance between the desired behaviour and the behaviour of the controlled plant achievable under probabilistic control.
@inproceedings{PantelicLawford2009, author = {Vera Pantelic and Mark Lawford} title = {Towards Optimal Supervisory Control of Probabilistic Discrete Event Systems}, booktitle = {DCDS 2009: 2nd IFAC Workshop on Dependable Control of Discrete Systems}, year = {2009}, location = {Bari, Italy} pages = {85-90} }