A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control
Authors:
- 1 July 2008
- journal article
- Published by Taylor & Francis in SICE Journal of Control, Measurement, and System Integration
- Vol. 1 (4) , 307-311
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Concurrent SecretsDiscrete Event Dynamic Systems, 2007
- Notions of security and opacity in discrete event systems2007
- On the Verification of Intransitive Noninterference in Mulitlevel SecurityIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2005
- Modelling Opacity Using Petri NetsElectronic Notes in Theoretical Computer Science, 2005
- On controllability and normality of discrete event dynamical systemsSystems & Control Letters, 1991
- Formulas for calculating supremal controllable and normal sublanguagesSystems & Control Letters, 1990
- On observability of discrete-event systemsInformation Sciences, 1988
- Supervisory control of discrete-event processes with partial observationsIEEE Transactions on Automatic Control, 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