Back to Search
Start Over
On Solvability of a Decentralized Supervisory Control Problem With Communication.
- Source :
-
IEEE Transactions on Automatic Control . Mar2009, Vol. 54 Issue 3, p468-480. 13p. 1 Black and White Photograph, 1 Chart, 1 Graph. - Publication Year :
- 2009
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 54
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 37045475
- Full Text :
- https://doi.org/10.1109/TAC.2009.2012974