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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4423 LNCS, Issue , 2007, Pages 228-242

  Hirschkoff, Daniel ^a   Pous, Damien ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

AXIOMATISATION; BISIMILARITY; DISTRIBUTION LAW;

MATHEMATICAL OPERATORS;

EID: 37149048767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_17     Document Type: Conference Paper

References (14)

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. Handbook of Process Algebra, chapter Process Algebras with Localities, pages 945-1045. North-Holland, 2001.
5. F. Corradini, R. Gorrieri, and D. Marchignoli. Towards parallelization of concurrent systems. Informatique Théorique et Applications, 32(4-6):99-125, 1998.
6. 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.
7. Y. Hirshfeld and M. Jerrum. Bisimulation Equivalence is Decidable for Normed Process Algebra. Technical Report ECS-LFCS-98-386, LFCS, 1998.
8. Y. Hirshfeld and M. Jerrum. Bisimulation Equivalence is Decidable for Normed Process Algebra. In Proc. of ICALP'99, volume 1644 of LNCS, pages 412-421. Springer Verlag, 1999.
9. B. Luttik. What is Algebraic in Process Theory? Concurrency Column, Bulletin of the EATCS, 88, 2006.
10. R. Milner and F. Moller. Unique Decomposition of Processes. TCS, 107(2): 357-363, 1993.
11. F. Moller. Axioms for Concurrency. PhD thesis, University of Edinburgh, 1988.
12. D. Sangiorgi. A Theory of Bisimulation for the ω-Calculus. Acta Informatica, 33(1):69-97, 1996.
13. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
14. 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.