Realization of asynchronous finite-state machines

Asynchronous finite-state machines accurately represent the action of computer control systems on continuous and discrete processes. Despite their importance, the lack of a general analytic representation for asynchronous machines has prevented the development of adequate techniques for analysis and design of finite-state asynchronous control systems, while ad hoc real-time control software has proliferated. In this paper, a general realization method is presented.

[1]  Martin E. Kaliski,et al.  Functional Equivalence in a Class of Autonomous One-Dimensional Nonlinear Discrete-Time Systems , 1979, Inf. Control..

[2]  S. Mitter,et al.  Controllability, observability, pole allocation, and state reconstruction , 1971 .

[3]  Timothy Johnson Analytic models of multitask processes , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.