Abstract
We present complete axiomatizations of weak hypcrcongruence in the finite fragment of the fusion calculus, an extension and simplification of the π-calculus. We treat both the full fusion calculus and the subcalculus without mismatch operators. The axiomatizations are obtained from the laws for hyperequivalence and adding so called tau-laws. These are similar to the well known tau-laws for CCS and the π-calculus, but there is an interesting difference which highlights an aspect of the higher expressive power of the fusion calculus.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Fu. A proof-theoretical approach to communication. In P. Degano, R. Gorrieri and A. Marchetti-Spaccamela, eds, Proceedings of ICALP '97, volume 1256 of LNCS, pages 325–335. Springer, 1997.
R. v. Glabbeek. The linear time — branching time spectrum II; the semantics of sequential systems with silent moves (extended abstract). In E. Best, ed, Proceedings of CONCUR'93, volume 715 of LNCS, pages 66–81. Springer, 1993.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, 1985.
H. Lin. Complete inference systems for weak bisimulation equivalences in the π-calculus. In P. D. Mosses, M. Nielsen and M. I. Schwarzbach, eds, Proceedings of TAPSOFT '95, volume 915 of LNCS, pages 187–201. Springer, 1995.
H. Lin. Unique fixpoint induction for mobile processes. In I. Lee and S. A. Smolka, eds, Proceedings of CONCUR '95, volume 962 of LNCS, pages 88–102. Springer, 1995.
R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, Sept. 1992.
J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 120(2):174_197, 1995.
J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS '98. IEEE, Computer Society Press, 1998. Available from http://www.docs.uu.se/victor/tr/f usion.html.
B. Victor. Symbolic characterizations and algorithms for hyperequivalence and open bisimulation. Submitted for publication. Available from http://www.docs.uu.se/~victor/tr/symhyper.html, Mar. 1998.
B. Victor and J. Parrow. Concurrent constraints in the fusion calculus. In Proceedings of ICALP '98, volume 1443 of LNCS. Springer, 1998. Available from http://www.docs.uu.se/~victor/tr/ccfc.html.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parrow, J., Victor, B. (1998). The tau-laws of fusion. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055618
Download citation
DOI: https://doi.org/10.1007/BFb0055618
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive