Modular Control of Discrete-Event Systems With Coalgebra
Authors:
- Jan KomendaJKJan Komenda
- Jan H. van SchuppenJSJan H. van Schuppen
- 14 March 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 53 (2) , 447-460
Abstract
Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results are generalized to the case of modules with partial observations: e.g., modular computation of supremal normal sublanguages is studied. Coalgebraic techniques based on the coinduction proof principle are used in our main results. Sufficient conditions are derived for modular to equal global control synthesis. An algorithmic procedure for checking the new conditions is proposed and the computational benefit of the modular approach is discussed and illustrated by comparing the time complexity of modular and monolithic computation.Keywords
This publication has 26 references indexed in Scilit:
- A final coalgebra theorem2005
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- Decentralized control of discrete event systems with specializations to local control and concurrent systemsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2000
- The realization of input-output maps using bialgebrasForum Mathematicum, 1992
- 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 closed controllable superlanguage and its application in supervisory controlIEEE Transactions on Automatic Control, 1990
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observationsTheory of Computing Systems, 1989
- The control of discrete event systemsProceedings of the IEEE, 1989
- On observability of discrete-event systemsInformation Sciences, 1988