Formulas for calculating supremal controllable and normal sublanguages
- 31 August 1990
- journal article
- Published by Elsevier in Systems & Control Letters
- Vol. 15 (2) , 111-117
- https://doi.org/10.1016/0167-6911(90)90004-e
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observationsTheory of Computing Systems, 1989
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observationMathematics of Control, Signals, and Systems, 1989
- Supervisor specification and synthesis for discrete event systemsInternational Journal of Control, 1988
- Decentralized supervisory control of discrete-event systemsInformation Sciences, 1988
- On observability of discrete-event systemsInformation Sciences, 1988
- Supervisory control of discrete-event processes with partial observationsIEEE Transactions on Automatic Control, 1988
- Modular supervisory control of discrete-event systemsMathematics of Control, Signals, and Systems, 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