Model matching for finite-state machines
- 1 November 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 46 (11) , 1726-1743
- https://doi.org/10.1109/9.964683
Abstract
The problem of model matching for finite state machines (FSMs) consists of finding a controller for a given open-loop system so that the resulting closed-loop system matches a desired input-output behavior. In this paper, a set of model matching problems is addressed: strong model matching (where the reference model and the plant are deterministic FSMs and the initial conditions are fixed), strong model matching with measurable disturbances (where disturbances are present in the plant), and strong model matching with nondeterministic reference model (where any behavior out of those in the reference model has to be matched by the closed-loop system). Necessary and sufficient conditions for the existence of controllers for all these problems are given. A characterization of all feasible control laws is derived and an efficient synthesis procedure is proposed. Further, the well-known supervisory control problem for discrete-event dynamical systems (DEDSs) formulated in its basic form is shown to be solvable as a strong model matching problem with measurable disturbances and nondeterministic reference model.Keywords
This publication has 23 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Model matching for finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computing simulations on finite and infinite graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State MachinesDiscrete Event Dynamic Systems, 1998
- Theory and algorithms for state minimization of nondeterministic FSMsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- On the computational complexity of bisimulationACM Computing Surveys, 1995
- Asymptotic model matching for nonlinear systemsIEEE Transactions on Automatic Control, 1994
- Nonlinear strong model matchingIEEE Transactions on Automatic Control, 1990
- Structure and design of linear model following systemsIEEE Transactions on Automatic Control, 1973
- Model matching by state feedback and dynamic compensationIEEE Transactions on Automatic Control, 1972