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
Design and implementation of a Petri net based supervisor for a flexible manufacturing system
Automatica (Journal of IFAC)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Communication and Concurrency
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Modular Control and Coordination of Discrete-Event Systems
Discrete Event Dynamic Systems
On the Computation of Observers in Discrete-Event Systems
Discrete Event Dynamic Systems
Approximating the Minimal Sensor Selection for Supervisory Control
Discrete Event Dynamic Systems
Computationally efficient supervisor design for discrete-event systems
Computationally efficient supervisor design for discrete-event systems
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
On the complexity of supervisory control design in the RW framework
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Supervisory control synthesis of discrete-event systems using a coordination scheme
Automatica (Journal of IFAC)
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
| Hi-index | 0.00 |
Natural projections with the observer property have proved effective in reducing the computational complexity of nonblocking supervisory control design, and the state sizes of the resulting controllers. In this paper we present an algorithm to verify this property, or if necessary to achieve it. A natural projection is a special type of general causal reporter map; for the latter an algorithm is already known for verification and modification. This algorithm could be used to verify the observer property of a natural projection, but if the natural projection is not an observer the algorithm is not applicable to modify it to an observer. Also, while a general reporter map always admits a unique smallest refinement with the observer property, a natural projection does not. Indeed there may exist several minimal extensions to the original observable event set of a natural projection. We show that the problem of finding a minimal extension is NP-hard, but propose a polynomial-time algorithm that always finds an acceptable extension. While not guaranteed to be minimal, it is in practice often reasonably small.