Abstract
We define net-based formal models for concurrent processes communicating by asynchronous message passing. Programs specified in an abstract language are modelled by fifo-nets with composition operators, and for the first time extended compositionality and partial order semantics are considered in the fifo-net context. This leads to an algebra of fifo-nets, together with different congruences, which extends to the asynchronous communication part of the work on CCS, TCSP and ACP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.A. Bergstra, J.W. Klop, J.V. Tucker, Process algebra with asynchronous communication mechanism, Seminar on concurrency, LNCS 197(1985).
E. Best, Concurrent behaviours: sequences, processes and axioms, LNCS 255 (1987).
E. Best, COSY: its relationship to Nets and CSP, LNCS 197 (1986).
D.Brand,P.Zafiropoulos, On Communicating Finite-state Machines, JACM vol nℴ2, April 1983.
G. Boudol, I. Castellani, Concurrency and Atomicity, Theoretical Computer Science 59 (1988), pp. 25–84
P.Degano, R.De Nicola, U.Montanari, A distributed operational semantics for CCS based on C/E systems, Acta Informatica, 26, 1988.
J. Fanchon, An Algebra of Fifo-Nets, RR LRI, to appear.
A.Finkel, G.Memmi, Fifo nets: a new model of parallel computation, Proc. 6th conf. on Theor. Comp. Sci., LNCS 145, 1983.
R.van Glabeek, F. Vaandrager, Petri nets models for algebraic theories of concurrency, LNCS 259 (1987) 224–242.
U. Goltz, CCS and Petri Nets, LNCS 469, 1990.
M.G. Gouda, L.E. Rosier, Priority networks of communicating finite state machines, SIAM J.Comput. Vol. 14, nℴ3 (1985).
J. Grabowski, On partial languages, Fundamenta Informaticae IV. 2, 1981.
A.Kiehn, Local and Global Causes, TUM research report nℴ 342/23/91 A, August 1991.
A. Mazurkiewicz, Trace theory, LNCS 255 (1986).
R. Milner, Lectures on a Calculus for Communicating Systems, Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220
L.Pomello, Some equivalence notions for concurrent systems, LNCS 222 (1986).
V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fanchon, J. (1992). A fifo-net model for processes with asynchronous communication. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_171
Download citation
DOI: https://doi.org/10.1007/3-540-55610-9_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55610-7
Online ISBN: 978-3-540-47258-2
eBook Packages: Springer Book Archive