Abstract
We study a non interleaving subalgebra of a reduct of a model of ACP. The model discussed uses step bisimulation semantics. We can derive identities in this model with the help of the (interleaving) ACP calculus with multi-actions. We study the connection with Petri nets, and introduce causalities and a causal state operator.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, Inf. & Comp. 78 (3), 1988, pp. 205–245.
J.C.M. Baeten & J.A. Bergstra, Real time process algebra, in Formal Aspects of Computing 3 (2), 1991, pp. 142–188.
J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in TCS 18, Cambridge University Press 1990.
J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, 1984, pp. 109–137.
J.A. Bergstra & J.W. Klop, Verification of an alternating bit protocol by means of process algebra, in: Math. Methods ov Spec. and Synthesis of Software Systems '85 (W. Bibel & K.P. Jantke, eds.), Springer LNCS 215, 1986, pp. 9–23.
J.A. Bergstra, J.W. Klop & J.V. Tucker, Process algebra with asynchronous communication mechanisms, in Proc. Seminar on Concurrency (S.D. Brookes, A.W. Roscoe & G. Winskel, eds.), Springer LNCS 197, 1985, pp. 76–95.
E. Best, R. Devillers & J.G. Hall, The Petri box calculus: a new causal algebra with multilabel communication, in: Advances in Petri Nets 92 (G. Rozenberg, ed.), Springer LNCS 609, 1992, pp. 21–69.
I. Castellani & M. Hennessy, Distributed bisimulations, JACM 10, 1989, pp. 887–911.
R.J. van Glabbeek & F.W. Vaandrager, Petri net models for algebraic theories of concurrency, in: Proc. PARLE, Eindhoven (J.W. de Bakker, A.J. Nijman & P.C. Treleaven, eds.), Springer LNCS 259, 1987, pp. 224–242.
U. Goltz, On representing CCS programs by finite Petri nets, in Proc. MFCS 88, Springer LNCS 324, 1988, pp. 339–350.
W. Janssen, M. Poel & J. Zwiers, Action systems and action refinement in the development of parallel systems, in: Proc. CONCUR'91 (J.C.M. Baeten & J.F. Groote, eds.), Springer LNCS 527, 1991, pp. 298–316.
A. Kiehn, Distributed bisimulations for finite CCS, report 7/89, University of Sussex 1989.
R. Milner, Elements of interaction (Turing Award lecture), Comm. of the ACM 36 (1), 1993, pp. 78–89.
R. Milner & F. Moller, Unique decomposition of processes, Theor. Comp. Sci. 107 (2), 1993, pp. 357–363.
M. Nielsen & P.S. Thigarajan, Degrees of non-determinism and concurrency: a Petri net view, in: Proc. 5th FST&TCS (M. Joseph & R. Shyamasundar, eds.), Springer LNCS 181, 1984, pp. 89–118.
C. Petri, Introduction to general net theory, in: Net Theory and Applications (W. Brauer, ed.), Springer LNCS 84, 1980, pp. 1–19.
L. Pomello, Some equivalence notions for concurrent systems. An overview, in: Advances in Petri Nets 1985 (G. Rozenberg, ed.), Springer LNCS 222, 1986, pp. 381–400.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baeten, J.C.M., Bergstra, J.A. (1993). Non interleaving process algebra. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive