Abstract
Two proof systems for the congruences of causal bisimulation and location equivalence of finite CCS are proposed. They generalize the known axiomatizations for restriction free processes which are based on the two merge operators of ACP. Since the proof systems only differ in three equations they provide a simple means of comparison.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto. Action Refinement in Process Algebra. Ph.d. thesis, University of Sussex, 1991.
L. Aceto. A static view of localities. Report 1483, INRIA, 1991.
L. Aceto. Relating distributed, temporal and causal observations of simple processes. Technical Memo HPL-PSC-92-32, Hewlett-Packard Laboratories, Pisa Science Center, 1992.
J. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, (37):77–121, 1985.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Report 4/91, University of Sussex, 1991. Extended abstract in the proceedings of MFCS 91, LNCS 520.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Report 13/91, University of Sussex, 1991. Extended abstract in the proceedings of CONCUR 92.
P. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP 88, number 372 in Lecture Notes in Computer Science, pages 234–248, 1989.
P. Degano, R. De Nicola, and U. Montanari. Universal axioms for bisimulations. Report TR-9/92, University of Pisa, 1992.
P. Degano and C. Priami. Proved trees. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 629–640. Springer-Verlag, 1992.
G. Ferrari, R. Gorrieri, and U. Montanari. Parametric laws for concurrency. In Proceedings of Tapsoft 91, number 494 in Lecture Notes in Computer Science, 1991.
M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal of Computing, 17(5):997–1017, 1988.
M. Hennessy. A proof system for weak ST-bisimulation over a finite process algebra. Report 6/91, University of Sussex, 1991.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32(1):137–161, 1985.
A. Kiehn. Comparing locality and causality based equivalences (Revision of: Local and global causes. Report TUM-I9132, Technische Universität München, 1992).
A. Kiehn. Proof systems for cause based equivalences, full paper, 1993.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
F. Moller. Axioms for Concurrency. Ph.d. thesis, University of Edinburgh, 1989.
U. Montanari and D. Yankelevich. A parametric approach to localities. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 617–628. Springer-Verlag, 1992.
R.J. van Glabbeek and F.W. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Prooceedings PARLE conference, number 259 in Lecture Notes in Computer Science, pages 224–242. Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiehn, A. (1993). Proof systems for cause based equivalences. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_46
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive