On Bisimulations for the Asynchronous pi-Calculus

[1]  Davide Sangiorgi,et al.  Some Congruence Properties for Pi-Calculus Bisimilarities , 1998, Theor. Comput. Sci..

[2]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[3]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1996, CONCUR.

[4]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[5]  Josva Kleist,et al.  Bisimulations for Asynchronous Mobile Processes , 1995 .

[6]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[7]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

[8]  Mads Dam,et al.  Model Checking Mobile Processes , 1993, Inf. Comput..

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

[10]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[11]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[12]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[13]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[14]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[15]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[16]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.