Abstract
We define an algebraic language for networks consisting of a finite number of nodes whose ports are interconnected by links. The language contains two types of operations: parallel composition of two networks, and interlinking of two ports within a network. We interpret this language in both a structural way and a behavioural way; in the latter interpretation the networks are regarded as schemas where the nodes can be instantiated to processes communicating over the links. This gives rise to structural and behavioural equivalences; these equivalences are given sound and complete axiomatisations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D Austry and G Boudol. Algèbre de processus et synchronisation. Theoretical Computer Science, 30(1):91–131, 1984.
S. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560–599, 1984.
J. Bergstra and J. Tucker. Top-down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171–199, 1985.
Bengt Jonsson. A model and proof system for asynchronous networks. In Proceedings of the 4:th ACM Symposium on Principles of Distributed Computing, pages 49–58, 1985.
G Kahn. The semantics of a simple language for parallel programming. In IFIP 74, pages 471–475, 1974.
R M Keller and P Panangaden. Semantics of networks containing indeterminate operators. In Brookes, Roscoe, and Winskel, editors, Seminar on Concurrency 1984, LNCS 197, pages 479–496, 1985.
Robin Milner. Flowgraphs and flow algebras. J. ACM, 26(4):794–818, 1979.
Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
George Milne. CIRCAL and the representation of communication, concurrency and time. ACM Transactions on Programming Languages and Systems, 7(2):270–298, 1985.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
David Park. The ‘fairness’ problem and nondeterministic computing networks. In de Bakker and van Leeuwen, editors, Foundations of Computer Science IV. Part 2, pages 133–161. Amsterdam, 1983. Mathematical Centre Tracts 159.
Joachim Parrow. Synchronisation flow algebra. Technical Report LFCS-87-35, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1987.
Joachim Parrow. The expressive power of simple parallelism. In Proceedings of PARLE '89, Vol. II; LNCS 366, pages 389–405, 1989.
J Staples and V L Nguyen. A fixpoint semantics for nondeterministic data flow. J. ACM, 32(2):411–444, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parrow, J. (1990). Structural and behavioural equivalences of networks. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032057
Download citation
DOI: https://doi.org/10.1007/BFb0032057
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive