By Topic

On Solvability of a Decentralized Supervisory Control Problem With Communication

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)
Kunihiko Hiraishi ; Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Nomi

We study a decentralized control problem of discrete event systems with communication. We first give a general automata-theoretic formalism that enables us to handle various types of communication, including delay. The decentralized control problem is shown to be undecidable under this formalism. Next we propose a semi-decision procedure for computing finite-state controllers to achieve a given specification in the sense of bisimilarity between the controlled system and a given specification. Using this procedure, we prove decidability of the problem for two special cases, one is the case in which the communication behavior is given as k -bounded-delay communication, and the other is the case in which any cycle in the state transition diagram of the system contains an event observable by all controllers. We also show a method for optimizing controllers based on a graph problem.

Published in:

IEEE Transactions on Automatic Control  (Volume:54 ,  Issue: 3 )