A fully abstract domain model for the /spl pi/-calculus

Abramsky's domain equation for bisimulation and the author's categorical models for names combine to give a domain-theoretic model for the /spl pi/-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).

[1]  Ian Stark.  Categorical models for local names , 1996, LISP Symb. Comput..

[2]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[3]  Davide Sangiorgi.  Internal Mobility and Agent-Passing Calculi , 1995, ICALP.

[4]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[6]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Roberto M. Amadio,et al.  Toward a Modal Theory of Types for the pi-Calculus , 1996, FTRTFT.

[8]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1995, Inf. Comput..

[9]  Ian David Bede Stark,et al.  Names and higher-order functions , 1994 .

[10]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[11]  Davide Sangiorgi,et al.  Locality and True-concurrency in Calculi for Mobile Processes , 1994, TACS.

[12]  Matthew Hennessy.  A Fully Abstract Denotational Model for Higher-Order Processes , 1994, Inf. Comput..

[13]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[14]  B. Day.  On closed categories of functors , 1970 .

[15]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[16]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[17]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[18]  D. Sangiorgi.  - calculus , internal mobility , and agent-passing calculi , 1995 .

[19]  A. Ingólfsdóttir.  A Semantic Theory for Value–Passing Processes Late Approach Part I: A Denotational Model and Its Complete Axiomatization , 1995 .

[20]  Andrew M. Pitts,et al.  A co-Induction Principle for Recursively Defined Domains , 1994, Theor. Comput. Sci..

[21]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[22]  Davide Sangiorgi,et al.  A Fully Abstract Semantics for Causality in the Pi-Calculus , 1995, STACS.

[23]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..