Models for name-passing processes: interleaving and causal

We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual /spl pi/-calculus operations, defining indexed labelled transition systems. For non-interleaving causal semantics, we define indexed labelled asynchronous transition systems, smoothly generalizing both our interleaving model and the standard asynchronous transition systems model for CCS-like calculi. In each case we relate a denotational semantics to an operational view for bisimulation and causal bisimulation respectively. This is a first step towards a uniform understanding of the semantics and operations of name-passing calculi.

[1]  Jan Vitek,et al.  Secure composition of insecure components , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[2]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[3]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[4]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

[5]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[6]  Peter Sewell,et al.  On Implementations and Semantics of a Concurrent Programming Language , 1997, CONCUR.

[7]  Jan Vitek,et al.  Secure composition of untrusted code: wrappers and causality types , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[8]  Rocco De Nicola,et al.  A Symbolic Semantics for the pi-Calculus , 1996, Inf. Comput..

[9]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

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

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

[12]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[13]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[14]  Glynn Winskel,et al.  Presheaf Models for the pi-Calculus , 1997 .

[15]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[16]  Davide Sangiorgi,et al.  A fully abstract semantics for causality in the $\pi$-calculus , 1998, Acta Informatica.

[17]  R. Gorrieri.  A Petri Net Semantics for -calculus ? , 1995 .

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

[19]  Rocco De Nicola,et al.  On the consistency of 'truly concurrent' operational and denotational semantics , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[20]  Corrado Priami,et al.  Non-Interleaving Semantics for Mobile Processes , 1999, Theor. Comput. Sci..

[21]  Bent Thomsen,et al.  A fully abstract denotational semantics for the calculus of higher-order communicating systems , 2001, Theor. Comput. Sci..

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

[23]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[24]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[25]  M. Hoffman.  Semantical analysis of higher-order abstract syntax , 1999 .

[26]  Glynn Winskel,et al.  Models for concurrency: towards a classification , 1996 .

[27]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[28]  Radha Jagadeesan,et al.  Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract) , 1995, AMAST.

[29]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[30]  Roberto Gorrieri,et al.  A Petri Net Semantics for pi-Calculus , 1995, CONCUR.

[31]  Gérard Boudol,et al.  Asynchrony and the Pi-calculus , 1992 .

[32]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[33]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

[34]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[35]  Glynn Winskel,et al.  Weak Bisimulation and Open Maps , 1999 .

[36]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[37]  P. Quaglia.  On the Finitary Characterization of pi-Congruences , 1997 .

[38]  Glynn Winskel,et al.  Presheaf Models for the pi-Calculus , 1997, Category Theory and Computer Science.

[39]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[40]  Peter Selinger,et al.  First-Order Axioms for Asynchrony , 1997, CONCUR.

[41]  Marco Pistore,et al.  π-Calculus, structured coalgebras, and minimal HD-automata , 2000 .

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

[43]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[44]  Walter Vogler.  Generalized OM-Bisimulation , 1995, Inf. Comput..

[45]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes , 1995, Inf. Comput..

[46]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[47]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

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

[49]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[50]  Vladimiro Sassone,et al.  Comparing Transition Systems with Independence and Asynchronous Transition Systems , 1996 .

[51]  Marco Pistore,et al.  Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”. , 1995 .

[52]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.