Abstract
An algebraic theory of receptive processes is presented. A receptive process models the interaction by input events and output events between a system and its environment. Input from the environment and output to the environment are never blocked; but if a system is not ready to receive a particular input, its subsequent behaviour is undefined.
In essence, this paper reworks Hoare's theory of Communicating Sequential Processes under the above assumption about communication. The resulting model is more attractive than the failures-divergences model of CSP because the refusal sets of the latter are simplified out of existence. Like CSP, receptive process theory is equipped with a sound and complete set of algebraic laws.
Applications of the theory include the design of asynchronous circuits and the study of data flow networks. As an example, this paper verifies algebraically the design of a Muller C-element from a majority-element.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brookes, S.D.: A model for communicating systems. PhD Thesis, Oxford University 1983
Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating sequential processes (Lect. Notes Comput. Sci., vol. 197, pp. 281–305). Berlin, Heidelberg, New York: Springer 1984
Dill, D.L.: Trace theory for automatic hierarchical verification of speed-independent circuits. Cambridge, MA, London: MIT Press 1989
He, J., Josephs, M.B., Hoare, C.A.R.: A theory of synchrony and asynchrony. In: Broy, M., Jones, C.B. (eds) Programming concepts and methods, pp. 459–478. Amsterdam: North-Holland 1990
Hennessy, M.: Algebraic theory of processes. Cambridge: MIT Press 1988
Hoare, C.A.R.: Communicating sequential processes. Commun. ACM21, 666–677 (1978)
Hoare, C.A.R.: Communicating sequential processes. Engelwood Cliffs, NJ: Prentice-Hall 1985
Jonsson, B.: Compositional verification of distributed systems. PhD Thesis, DoCS 87/9, Uppsala University 1987
Josephs, M.B., Hoare, C.A.R., He, J.: A theory of asynchronous processes. Technical Report, PRG-TR-6-89, Oxford University 1989
Josephs, M.B., Udding, J.T.: An algebra for delay-insensitive circuits. In: Clarke, E.M., Kurshan, R.P. (eds) DIMACS Series in discrete mathematics and theoretical computing science 3, pp. 147–175, AMS-ACM 1991
Josephs, M.B., Udding, J.T.: Delay-insensitive circuits: An algebraic approach to their design. (Lect. Notes Comput. Sci., vol. 458, pp. 342–366). Berlin, Heidelberg, New York: Springer 1990
Josephs, M.B., Udding, J.T.: The design of a delay-insensitive stack. In: Jones, G., Sheeran, M. (eds) Designing correct circuits, pp. 132–152. Berlin, Heidelberg, New York: Springer 1990
Mead, C., Conway, L.: Introduction to VLSI systems. Reading, MA: Addison-Wesley 1980
Milner, A.J.R.G.: A calculus of communicating systems. (Lect. Notes Comput. Sci., vol. 92). Berlin, Heidelberg, New York: Springer 1980
Milner, A.J.R.G.: Communication and concurrency. Engelwood Cliffs, NJ: Prentice-Hall 1989
Snepscheut, J.L.A. van de: Trace theory and VLSI design. (Lect. Notes Comput. Sci., vol. 200). Berlin, Heidelberg, New York: Springer 1985
Stark, E.W.: Foundations of a theory of specification for distributed computing. PhD Thesis, MIT/LCS/TR-342, MIT 1984
Roscoe, A.W., Hoare, C.A.R.: The laws of Occam programming. Theor. Comput. Sci.60, 177–229 (1988)
Udding, J.T.: A formal model for defining and classifying delay-insensitive circuits and systems. Distrib. Comput.1, 197–204 (1986)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Josephs, M.B. Receptive process theory. Acta Informatica 29, 17–31 (1992). https://doi.org/10.1007/BF01178564
Received:
Issue date:
DOI: https://doi.org/10.1007/BF01178564