A distribution law for ccs and a new congruence result for the π-calculus

Logical Methods in Computer Science

Volumn 4, Issue 2, 2008, Pages

  Hirschkoff, Daniel ^a   Pous, Damien ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

calculus; Axiomatisation; Bisimulation; CCS; Process algebra

Indexed keywords

AXIOMATI-SATION; BISIMILARITY; BISIMULATIONS; CCS; DISTRIBUTION LAW; PROCESS ALGEBRAS; PI CALCULUS;

COMPUTER SCIENCE; COMPUTERS;

CALCULATIONS;

EID: 77955337582     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(2:4)2008     Document Type: Article

References (16)

1. L. Aceto, W. J. Fokkink, A. Ingolfsdottir, and B. Luttik. Finite Equational Bases in Process Algebra: Results and Open Questions. In Processes, Terms and Cycles: Steps on the Road to Infinity, volume 3838 of LNCS. Springer Verlag, 2005.
2. M. Boreale and D. Sangiorgi. Some Congruence Properties for λ-calculus Bisimilarities. TCS, 198: 159-176, 1998.
3. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification over Infinite States. In Handbook of Process Algebra, pages 545-623. Elsevier, 2001.
4. I. Castellani. Bisimulations for Concurrency. PhD thesis, Edinburgh University, 1988. Available as report CST-51-88 and LFCS-88-51.
5. I. Castellani and M. Hennessy. Distributed bisimulations. J. ACM, 36(4): 887-911, 1989.
6. F. Corradini, R. Gorrieri, and D. Marchignoli. Towards parallelization of concurrent systems. Informatique Théorique et Applications, 32(4-6): 99-125, 1998.
7. W. Fokkink and B. Luttik. An ω-complete Equational Specification of Interleaving. In Proc. of ICALP'00, volume 1853 of LNCS, pages 729-743. Springer Verlag, 2000.
8. J. F. Groote. A New Strategy for Proving ω-Completeness Applied to Process Algebra. In Proc. of CONCUR'90, LNCS, pages 314-331. Springer Verlag, 1990.
9. D. Hirschkoff and D. Pous. A Distribution Law for CCS and a New Congruence Result for the Pi-Calculus. In Proc. of FoSSaCS'07, LNCS, pages 228-242. Springer Verlag, 2007.
10. Y. Hirshfeld and M. Jerrum. Bisimulation Equivalence is Decidable for Normed Process Algebra. Technical Report ECS-LFCS-98-386, LFCS, 1998. an abstract has appeared in the proceedings of ICALP'99, LNCS 1644, Springer Verlag.
11. B. Luttik. What is Algebraic in Process Theory? Concurrency Column, Bulletin of the EATCS, 88, 2006.
12. R. Milner and F. Moller. Unique Decomposition of Processes. TCS, 107(2): 357-363, 1993.
13. F. Moller. Axioms for Concurrency. PhD thesis, University of Edinburgh, 1988.
14. D. Sangiorgi. A Theory of Bisimulation for the λ-Calculus. Acta Informatica, 33(1): 69-97, 1996.
15. D. Sangiorgi and D. Walker. The λ-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
16. B. Victor, F. Moller, M. Dam, and L.-H. Eriksson. The Mobility Workbench. available from http://www. it. uu. se/research/group/mobility/mwb, 2006.