Model matching for finite state machines

The problem of model matching for finite state machines (FSMs) is addressed. This problem consists of finding a controller for a given open loop system so that the resulting closed loop system matches a desired input-output behavior. A characterization of all feasible control laws is given and an efficient synthesis procedure is proposed.<<ETX>>

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

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

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

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

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

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

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

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

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

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

[11]  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.

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

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

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

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

[16]  Robert K. Brayton,et al.  State minimization of pseudo non-deterministic FSMs , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

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

[18]  Fabrizio Luccio,et al.  A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

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

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

[21]  Tiziano Villa,et al.  A Fully Implicit Algorithm for Exact State Minimization , 1994, 31st Design Automation Conference.

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

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

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

[25]  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).