On the language generated under fully decentralized supervision
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 43 (9), 1253-1256
- https://doi.org/10.1109/9.718609
Abstract
This paper studies the language generated under fully decentralized supervision proposed by Kozak and Wonham (1995). The author assumes that desirable behavior is specified as a closed language. A closed-form expression for the language generated under fully decentralized supervision is presented. It is shown that the generated language is larger than the supremal closed, controllable, and strongly decomposable sublanguage. Moreover, a necessary and sufficient condition is derived for the generated language to be the supremal closed and controllable sublanguage.Keywords
This publication has 14 references indexed in Scilit:
- Design of transaction management protocolsIEEE Transactions on Automatic Control, 1996
- Fully decentralized solutions of supervisory control problemsIEEE Transactions on Automatic Control, 1995
- On-line control of partially observed discrete event systemsDiscrete Event Dynamic Systems, 1994
- Think globally, act locally: decentralized supervisory controlIEEE Transactions on Automatic Control, 1992
- Supervisory control of concurrent discrete-event systemsInternational Journal of Control, 1991
- The infimal prefix-closed and observable superlanguange of a given languageSystems & Control Letters, 1990
- Decentralized control and coordination of discrete-event systems with partial observationIEEE Transactions on Automatic Control, 1990
- Decentralized supervisory control of discrete-event systemsInformation Sciences, 1988
- On the Supremal Controllable Sublanguage of a Given LanguageSIAM Journal on Control and Optimization, 1987
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987