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
Communication and concurrency
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Formulas for calculating supremal controllable and normal sublanguages
Systems & Control Letters
The infimal prefix-closed and observable superlanguage of given language
Systems & Control Letters
Supervision of Infinite Behavior of Discrete-Event Systems
SIAM Journal on Control and Optimization
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Maximal Solutions in Decentralized Supervisory Control
SIAM Journal on Control and Optimization
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Discrete Event Dynamic Systems
Category Theory and Computer Science
Computation of Supremal Sublanguages of Supervisory Control Using Coalgebra
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Automata and coinduction (an exercise in coalgebra)
Automata and coinduction (an exercise in coalgebra)
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Supervisory control of discrete event systems
Mathematical and Computer Modelling: An International Journal
Control of discrete-event systems with modular or distributed structure
Theoretical Computer Science
Brief paper: Supervisory control of modular systems with global specification languages
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
A coalgebraic approach to supervisory control of partially observed mealy automata
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
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 | 0.01 |
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory control. A framework for control of discrete-event systems with partial observations is formulated in terms of coalgebra. The contributions to control theory are besides the framework, algorithms for supremal normal and supremal normal and controllable sublanguages of the plant.