Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Decentralized supervisory control of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Communication and Concurrency
Modular Control and Coordination of Discrete-Event Systems
Discrete Event Dynamic Systems
Supervisory Control of Distributed Systems: Conflict Resolution
Discrete Event Dynamic Systems
Hierarchical Fault Diagnosis for Discrete-Event Systems under Global Consistency
Discrete Event Dynamic Systems
On the Computation of Natural Observers in Discrete-Event Systems
Discrete Event Dynamic Systems
Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
Automatica (Journal of IFAC)
A SAT-based approach for the construction of reusable control system components
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Systems-theoretic view of component-based software development
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Modeling the supervisory control theory with alloy
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
| Hi-index | 0.01 |
The concept of observer was introduced in previous work by the authors on a hierarchical control theory of discrete-event systems (DES). It was shown that the observer property of the “causal reporter” map, which in this theory models information flow in a hierarchical DES, plays a role in ensuring that a nonblocking supervisor at a given level of a hierarchy does not cause blocking in the level below. In this paper, we investigate the following problem: Given a causal reporter map that is not an observer, how can we design an observer by modifying this map? In case the latter is represented by a finite Mealy automaton, an effective computational algorithm is developed for computing an observer with the coarsest possible equivalence kernel that is finer than that of the given map. Three examples are provided for illustration.