On the supermal controllable sublanguage of a given language
SIAM Journal on Control and Optimization
On observability of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Formulas for calculating supremal controllable and normal sublanguages
Systems & Control Letters
On controllability and normality of discrete event dynamical systems
Systems & Control Letters
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Branching time controllers for discrete event systems
Theoretical Computer Science
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Control of modular and distributed discrete-event systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
| Hi-index | 5.23 |
Most of the large scale state transition (also called discrete-event) systems are formed as parallel compositions of many small subsystems (modules). Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and distributed discrete-event systems sufficient and necessary conditions are derived for modular control synthesis to equal global control synthesis, while enforcing a safety specification in an optimal way (the language of the controlled system is required to be the supremal one achievable by an admissible controller and included in a safety specification language). The two cases of local (decomposable) and global (indecomposable) specifications are considered. The modular control synthesis has a much lower computational complexity than the corresponding global control synthesis for the respective sublanguages. The complexity is compared using explicit formulas.