Causality and replication in concurrent processes

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

Volumn 2890, Issue , 2003, Pages 307-318

  Degano, Pierpaolo ^a   Gadducci, Fabio ^a   Priami, Corrado ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Causal semantics; Process calculi; Replication operator

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CAUSAL SEMANTICS; CONCURRENT PROCESS; INTERLEAVING SEMANTICS; PARALLEL COMPOSITION; PROCESS CALCULI; RECURSIVE PROCESS; REPLICATION MECHANISM; REPLICATION OPERATOR;

SEMANTICS;

EID: 35248893454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (16)

1. M. Boreale and D. Sangiorgi. A fully abstract semantics for causality in the π-calculus. Acta Informatica, 35:353-400, 1998.
2. G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae, 11:433-452, 1988.
3. N. Busi, M. Gabbrielli, and G. Zavattaro. Replication vs. recursive definitions in channel based calculi. In J.C.M. Baeten, J.K. Lenstra, J. Parrow, and G.J. Woeginger, editors, Automata, Languages and Programming, volume 2719 of Lect. Notes in Comp. Science, pages 133-144. Springer, 2003.
4. Ph. Darondeau and P. Degano. Causal trees. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, Automata, Languages and Programming, volume 372 of Lect. Notes in Comp. Science, pages 234-248. Springer, 1989.
5. P. Degano, R. De Nicola, and U. Montanari. Partial ordering derivations for CCS. In L. Budach, editor, Fundamentals of Computation Theory, volume 199 of Lect. Notes in Comp. Science, pages 520-533. Springer, 1985.
6. P. Degano, F. Gadducci, and C. Priami. A concurrent semantics for CCS via rewriting logic. Theoret. Comput. Sci., 275:259-282, 2002.
7. P. Degano and C. Priami. Proved trees. In W. Kuich, editor, Automata, Languages and Programming, volume 623 of Lect. Notes in Comp. Science, pages 629-640. Springer, 1992.
8. P. Degano and C. Priami. Non interleaving semantics for mobile processes. Theoret. Comput. Sci., 216:237-270, 1999.
9. P. Degano and C. Priami. Enhanced operational semantics: A tool for describing and analysing concurrent systems. ACM Computing Surveys, 33:135-176, 2001.
10. J. Engelfriet. A multiset semantics for the pi-calculus with replication. Theoret. Comput. Sci., 153:65-94, 1996.
11. A. Kiehn. Comparing causality and locality based equivalences. Acta Informatica, 31:697-718, 1994.
12. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
13. R. Milner. The polyadic π-calculus: A tutorial. In F.L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Nato ASI Series F, pages 203-246. Springer, 1993.
14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Part I and II. Information and Computation, 100:1-77, 1992.
15. D. Sangiorgi. Locality and interleaving semantics in calculi for mobile processes. Theoret. Comput. Sci., 155:39-83, 1996.
16. D. Sangiorgi and D. Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.