By Topic

Bisimilarity Control under Partial Observation of Deterministic Discrete Event Systems

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

2 Author(s)
Changyan Zhou ; Department of Electrical & Computer Engineering, Iowa State University, Ames, IA 50014, ; Kumar, R.

The complexity of the general bisimilarity control problem under partial observation is doubly exponential in the product of the plant and the specification sizes [7]. In order to identify a special case where the complexity may be more manageable, we restrict attention to the class of deterministic plants. In this case, the complexity of verifying existence of a controller turns out to be polynomial, whereas that of performing its synthesis is singly exponential. We establish state-controllability (SC) together with state-recognizability (SR) as a necessary and sufficient condition for the existence of a control. The notion of SC was introduced in [8] as an existence condition for the same problem under the restriction of complete observability of events; and it generalizes the notion of language-controllability (LC) from the setting of language-control to bisimilarity-control. In the presence of partial observation, a supervisor is required to be observation-compatible (also called M-compatible), and the additional condition of SR is needed for the existence of such a supervisor. The property of SR is same as bisimilarity with such a system that can be transformed by state-mergers to a M-compatible system, without altering the bisimilarity of the control it exercises. SR generalizes the notion of language-recognizability [1] in a similar manner as SC generalizes LC. We show that SR is polynomially verifiable, and also present an exponential complexity algorithm for synthesizing of a bisimilarity enforcing Supervisor.

Published in:

Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on

Date of Conference:

12-15 Dec. 2005