Abstract
In this paper we sketch a general framework within which a study of networks of processes can be conducted. It is based upon the mathematical technique to abstract from irrelevant detail. We start out with a large class of objects and some operations upon them. Depending upon a correctness criterion to be imposed, some of these objects turn out to be equivalent. The resulting space of equivalence classes and operations upon them is, under certain conditions, the (fully) abstract space of interest for that particular correctness concern.
We use this approach to study networks for which we assume the communications to be asymmetric and asynchronous. We impose the correctness criterion of absence of computation interference. The resulting abstract space turns out to be the space of delay-insensitive specifications. As operator we study composition of networks. The composition operator on the resulting space is shown to have a surprisingly simple factorization property, the prove of which turns out to be very simple due to the approach taken.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Chen, J. T. Udding, and T. Verhoeff, Networks of Communicating Processes and Their (De)-Composition, Computing Science Note, Eindhoven Univ. of Techn., The Netherlands, 1989 (to appear).
D. L. Dill, Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits, PhD thesis, C.S. Dept., Carnegie Mellon Univ., Pittsburgh PA, 1988.
J. C. Ebergen, Translating Programs into Delay-Insensitive Circuits, PhD thesis, Eindhoven Univ. of Techn., The Netherlands, 1987.
M. Hennessy, Algebraic Theory of Processes, The MIT Press, Series in Found. of Comp., Cambridge MA, 1988.
C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall Int., London, 1985.
E.-R. Olderog and C. A. R. Hoare, “Specification-Oriented Semantics for Communicating Processes”, Acta Informatica, vol. 23, pp. 9–66, 1986.
J. T. Udding, Classification and Composition of Delay-Insensitive Circuits, PhD thesis, Eindhoven Univ. of Techn., The Netherlands, 1984.
J. T. Udding and T. Verhoeff, The mathematics of Directed Specifications, Technical Report WUCS-88-20, Washington University, St. Louis, June 1988.
T. Verhoeff, Notes on Delay-Insensitivity, Master's thesis, Eindhoven Univ. of Techn., The Netherlands, 1985.
M. Waardenburg, Composition and Classification of Components, Master's thesis, Eindhoven Univ. of Techn., The Netherlands, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, W., Udding, J.T., Verhoeff, T. (1989). Networks of communicating processes and their (De-)composition. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-51305-1_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51305-6
Online ISBN: 978-3-540-46191-3
eBook Packages: Springer Book Archive