By Topic

Towards supervisory control of Interactive Markov Chains: Plant minimization

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

1 Author(s)
Markovski, J. ; Eindhoven Univ. of Technol., Eindhoven, Netherlands

We extend a model-based systems engineering framework for supervisory control of nondeterministic stochastic discrete-event systems with controllability-preserving minimization of the unsupervised system. This is a second out of four phases outlined in the development of the framework. In the first phase, we proposed a process theory that captures the notion of controllability of the underlying model of Interactive Markov Chains using a behavioral relation termed Markovian partial bisimulation. Interactive Markov Chains extend (nondeterministic) labeled transition systems with Markovian (exponential) delays. The Markovian partial bisimulation is a stochastic extension of partial bisimulation that captures controllability by stating that controllable events should be simulated, whereas uncontrollable events should be bisimulated. The stochastic behavior is preserved up to lumping of Markovian delays. We develop a minimization algorithm for the preorder and equivalence induced by the Markovian partial bisimulation based on the most efficient algorithms for simulation and Markovian bisimulation.

Published in:

Control and Automation (ICCA), 2011 9th IEEE International Conference on

Date of Conference:

19-21 Dec. 2011