Finitely recursive process models for discrete event systems

• Published in: IEEE transactions on automatic control Vol. 33; no. 7; pp. 626 - 639
• Main Authors: Inan, K., Varaiya, P.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.07.1988; Institute of Electrical and Electronics Engineers
• Subjects: Applied sciences; Communication networks; Communication system control; Computer aided manufacturing; Computer networks; Computer science; control theory; systems; Control theory; Control theory. Systems; Discrete event systems; Exact sciences and technology; Manufacturing systems; Modelling and identification; Power system protection; Power system relaying; Supervisory control; Communication process; Language theory; Flexible manufacturing system; Complex system; Data transmission network; Finite recursive process; Discrete system; Real time; Modeling; Logic model; Supervision; Operating system
• ISSN: 0018-9286; 1558-2523
• DOI: 10.1109/9.1271

A class of discrete-event models called finitely recursive processes (FRP) is introduced. These models are motivated by problems in supervisory control, while some of the formal structure is based on C.A.R. Hoare's (1985) communicating sequential processes. Although only preliminary work is presented, it is believed that for many problems it offers a formalism that is superior to that of finite-state machines recently introduced in control theory. Simple examples illustrate the calculus of operators for FRPs. A more complex exercise is worked out to show how the formalism is used to construct a scheme for handling connections in a data network. This preliminary work needs to be extended in several directions, especially in directions that can assist implementation of real controllers based on the FRP formalism. Some specific suggestions towards this end are made.< >