Abstract
We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite π-calculus in absence of sum. To our knowledge, this is the only nontrivial subcalculus of the π-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
Aceto, L., et al.: Finite Equational Bases in Process Algebra: Results and Open Questions. In: Middeldorp, A., et al. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, Springer, Heidelberg (2005)
Boreale, M., Sangiorgi, D.: Some Congruence Properties for π-calculus Bisimilarities. TCS 198, 159–176 (1998)
Burkart, O., et al.: Verification over Infinite States. In: Handbook of Process Algebra, pp. 545–623. Elsevier, Amsterdam (2001)
Castellani, I.: Process Algebras with Localities. In: Handbook of Process Algebra, pp. 945–1045. North-Holland, Amsterdam (2001)
Corradini, F., Gorrieri, R., Marchignoli, D.: Towards parallelization of concurrent systems. Informatique Théorique et Applications 32(4-6), 99–125 (1998)
Fokkink, W., Luttik, B.: An ω-complete Equational Specification of Interleaving. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 729–743. Springer, Heidelberg (2000)
Hirshfeld, Y., Jerrum, M.: Bisimulation Equivalence is Decidable for Normed Process Algebra. Technical Report ECS-LFCS-98-386, LFCS (1998)
Hirshfeld, Y., Jerrum, M.: Bisimulation Equivalence is Decidable for Normed Process Algebra. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 412–421. Springer, Heidelberg (1999)
Luttik, B.: What is Algebraic in Process Theory? Concurrency Column, Bulletin of the EATCS 88 (2006)
Milner, R., Moller, F.: Unique Decomposition of Processes. TCS 107(2), 357–363 (1993)
Moller, F.: Axioms for Concurrency. PhD thesis, University of Edinburgh (1988)
Sangiorgi, D.: A Theory of Bisimulation for the π-Calculus. Acta Informatica 33(1), 69–97 (1996)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
B. Victor, F. Moller, M. Dam, and L.-H. Eriksson. The Mobility Workbench (2006), available from http://www.it.uu.se/research/group/mobility/mwb
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hirschkoff, D., Pous, D. (2007). A Distribution Law for CCS and a New Congruence Result for the π-Calculus. In: Seidl, H. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2007. Lecture Notes in Computer Science, vol 4423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71389-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-71389-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71388-3
Online ISBN: 978-3-540-71389-0
eBook Packages: Computer ScienceComputer Science (R0)