Finitely recursive process models for discrete event systems

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>