Abstract
We present a new class of discrete event models called Finitely Recursive Processes (FRP). These models are proposed to help in the specification, implementation and simulation of communication protocols and supervisory control strategies. We believe that the ‘algebra’ of FRPs offers certain advantages over models based on state machines. The formal structure of FRPs builds on Hoare's Communicating Sequential Processes (CRP). The main differences with CRP are: (1) a FRP is specified via recursion equations which clearly bring out the dynamic evolution of a process, (2) some additional operators for combining FRPs are introduced, (3) the structure of the ‘algebra’ of FRPs is exploited to suggest methods for simulating them.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cho, H. and Marcus, S.I. (1987). On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observations. Preprint. Department of Electrical and Computer Engineering, University of Texas, Austin, TX.
Cieslak, R., Desclaux, C., Fawaz, A. and Varaiya, P. (1986). Supervisory control of discrete event systems with partial observations. Preprint. Electronics Research Laboratory, University of California, Berkeley, CA.
Hoare, C.A.R. (1985). Communicating Sequential Processes. Prentice-Hall International, U.K. Ltd.
Hoperoft, J.E. and Ullman, J.D. (1979). Introduction to Automata theory, Languages, and Computation. Addison-Wesley.
Inan, K. and Varaiya, P. (1987). Finitely recursive process models for discrete event systems. Preprint. Electronics Research Laboratory, University of California, Berkeley, CA.
Lin, F. and Wonham, W.M. (1986). Decentralized supervisory control of discrete event systems. University of Toronto, Systems Control Group Report No. 8612.
Merlin, P. and Bochmann, G.v. (1983). On the construction of submodule specifications and communication protocols. ACM Trans. Prog. Lang. and Syst. Vol 5(1).
Peterson, J.L. (1981). Petri Net Theory and the Modelling of Systems. Prentice-Hall.
Ramadge, P.J. and Wonham, W.M. (1986). Modular supervisory control of discrete event systems. INRIA Conference. Paris.
Ramadge, P.J. and Wonham, W.M. (1987). On the supremal controllable sublanguage of a given language. SIAM J. Control and Optimization, Vol 25(3).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 International Institute for Applied Systems Analysis
About this paper
Cite this paper
Inan, K., Varaiya, P. (1988). Finitely Recursive Processes. In: Varaiya, P., Kurzhanski, A.B. (eds) Discrete Event Systems: Models and Applications. Lecture Notes in Control and Information Sciences, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042301
Download citation
DOI: https://doi.org/10.1007/BFb0042301
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18666-3
Online ISBN: 978-3-540-48045-7
eBook Packages: Springer Book Archive