Model matching for finite-state machines

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.

[1]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[2]  A. Isidori.  The matching of a prescribed linear input-output behavior in a nonlinear system , 1985 .

[3]  Tiziano Villa,et al.  Synthesis of FSMs: functional optimization , 1997 .

[4]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[5]  Robert K. Brayton,et al.  The maximum set of permissible behaviors for FSM networks , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[6]  Tiziano Villa,et al.  Implicit computation of compatible sets for state minimization of ISFSMs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[8]  A. Morse.  Structure and design of linear model following systems , 1973 .

[9]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[10]  S. Balemi,et al.  Supervisory control of a rapid thermal multiprocessor , 1993, IEEE Trans. Autom. Control..

[11]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[12]  Robert K. Brayton,et al.  Engineering change in a non-deterministic FSM setting , 1996, 33rd Design Automation Conference Proceedings, 1996.

[13]  Masahiro Fujita,et al.  Methods for automatic design error correction in sequential circuits , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[14]  Maria-Gabriella Di Benedetto,et al.  Nonlinear strong model matching , 1990 .

[15]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[16]  L. Silverman,et al.  Model matching by state feedback and dynamic compensation , 1972 .

[17]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[18]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[19]  A. Sangiovanni-Vincentelli,et al.  Strong model matching for finite state machines with non-deterministic reference model , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[20]  Abraham Ginzburg,et al.  Algebraic theory of automata , 1968 .

[21]  André Arnold,et al.  Finite transition systems - semantics of communicating systems , 1994, Prentice Hall international series in computer science.

[22]  Stéphane Lafortune,et al.  Bisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State Machines , 1998, Discret. Event Dyn. Syst..

[23]  Jessy W. Grizzle,et al.  Asymptotic model matching for nonlinear systems , 1994, IEEE Trans. Autom. Control..

[24]  Faron Moller,et al.  On the computational complexity of bisimulation , 1995, CSUR.

[25]  M.D. Di Benedetto,et al.  Model matching for finite state machines , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[26]  Rein Smedinga.  Using trace theory to model discrete events , 1988 .

[27]  Alan J. Hu,et al.  Checking for Language Inclusion Using Simulation Preorders , 1991, CAV.

[28]  Tiziano Villa,et al.  Theory and algorithms for state minimization of nondeterministic FSMs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[29]  Bard Bloom,et al.  Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem , 1995, Sci. Comput. Program..