Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On the supermal controllable sublanguage of a given language
SIAM Journal on Control and Optimization
Three partition refinement algorithms
SIAM Journal on Computing
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Process algebra
On controllability and normality of discrete event dynamical systems
Systems & Control Letters
SIAM Journal on Control and Optimization
Introduction to Digital Logic Design
Introduction to Digital Logic Design
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Compositional Abstractions of Hybrid Control Systems
Discrete Event Dynamic Systems
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Progressive solutions to a parallel automata equation
Theoretical Computer Science
Compositionally Progressive Solutions of Synchronous FSM Equations
Discrete Event Dynamic Systems
Sampled-Data Event Control of Hybrid Systems for Control Specifications Given by Predicate
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Control of Parameterized Discrete Event Systems
Discrete Event Dynamic Systems
Brief paper: Model matching inclusion for input/state asynchronous sequential machines
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
| Hi-index | 0.01 |
Afundamental relationship between the controllability of a languagewith respect to another language and a set of uncontrollableevents in the Supervisory Control Theory initiated by (Ramadgeand Wonham, 1989) and bisimulation of automata models is derived.The theoretical results relating bisimulation to controllabilitysupport an efficient solution to the Basic Supervisory ControlProblem. Using (Fernandez, 1990) generalization of the partitionrefinement algorithm of (Paige and Tarjan, 1987), it is possibleto find a partition which represents the supremal controllablesublanguage of an automaton with respect to the language of anotherautomaton and a set of events in a worst-case running time ofO( m\log(n)), where m is the numberof transitions and n is the number of states. Utilizingthe bisimulation property of language controllability and derivedrelationships between automata languages and input/output finite-statemachine behaviors, a precise relationship is formally derivedbetween Supervisory Control Theory and the system-theoretic problemposed by (DiBenedetto et al., 1994) called Strong Input/OutputFSM Model Matching. Specifically, it is proven that in deterministicsettings instances of each problem can be mapped to the otherframework and solved.