Proceedings ArticleDOI
Model matching for finite state machines
M.D. Di Benedetto,Alexander Saldanha,Alberto Sangiovanni-Vincentelli +2 more
- Vol. 3, pp 3117-3124
Reads0
Chats0
TLDR
In this article, the problem of model matching for finite state machines (FSMs) is addressed, which consists of finding a controller for a given open loop system so that the resulting closed loop system matches a desired input-output behavior.Abstract:
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. >read more
Citations
More filters
Journal ArticleDOI
Matrix Approach to Model Matching of Asynchronous Sequential Machines
Xiangru Xu,Yiguang Hong +1 more
TL;DR: Using semi-tensor product of matrices, an asynchronous machine is converted into a discrete-time bilinear system, and its dynamics is studied by investigating its structure matrices.
Journal ArticleDOI
On the control of asynchronous machines with races
TL;DR: In this paper, the problem of eliminating the effects of critical races on asynchronous machines is considered in a control theoretic context and necessary and sufficient conditions for the existence of such controllers and algorithms for their design are presented.
Journal ArticleDOI
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
TL;DR: A precise relationship is formally derived between Supervisory Control Theory and the system-theoretic problem posed by (DiBenedetto et al., 1994) called Strong Input/Output FSM Model Matching and it is proven that in deterministic settings instances of each problem can be mapped to the other framework and solved.
Journal ArticleDOI
Input/output control of asynchronous sequential machines
Xiaojun Geng,Jacob Hammer +1 more
TL;DR: The problem of controlling a finite-state asynchronous sequential machine is examined and necessary and sufficient conditions for the existence of appropriate controllers can be stated in terms of a simple comparison of two numerical matrices.
Journal ArticleDOI
On the control of asynchronous sequential machines with infinite cycles
N. Venkatraman,Jacob Hammer +1 more
TL;DR: The main objective is to develop state feedback controllers that stop infinite cycles in an existing asynchronous machine, while controlling the machine to match a prescribed model.
References
More filters
Journal ArticleDOI
Supervisory control of a class of discrete event processes
Peter J. Ramadge,W. M. Wonham +1 more
TL;DR: In this paper, the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and possibly non-deterministic, is studied. And the existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language, where the control process is described as the generator of a formal language, while the supervisor is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior.
Journal ArticleDOI
The control of discrete event systems
Peter J. Ramadge,W. M. Wonham +1 more
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.
Book ChapterDOI
Concurrency and Automata on Infinite Sequences
TL;DR: A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
Book
Automata, Languages, and Machines
TL;DR: This book attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest in formal languages and automata, written by Professor Ian Chiswell.
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.