Behavioral and Spatial Observations in a Logic for the pi-Calculus

In addition to behavioral properties, spatial logics can talk about other key properties of concurrent systems such as secrecy, freshness, usage of resources, and distribution. We study an expressive spatial logic for systems specified in the synchronous π-calculus with recursion, based on a small set of behavioral and spatial observations. We give coinductive and equational characterizations of the equivalence induced on processes by the logic, and conclude that it strictly lies between structural congruence and strong bisimulation. We then show that model-checking is decidable for a useful class of processes that includes the finite-control fragment of the π-calculus.

[1]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[2]  Davide Sangiorgi,et al.  Minimality Results for the Spatial Logics , 2003, FSTTCS.

[3]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[4]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[5]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

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

[7]  Silvano Dal-Zilio.  Spatial Congruence for Ambients Is Decidable , 2000, ASIAN.

[8]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

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

[10]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[12]  Luca Cardelli,et al.  Manipulating Trees with Hidden Labels , 2003, FoSSaCS.

[13]  Luca Cardelli,et al.  Subtyping recursive types , 1991, POPL '91.

[14]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[15]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[16]  Jaikumar Radhakrishnan,et al.  FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science , 2004, Lecture Notes in Computer Science.

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

[18]  Marco Pistore,et al.  pi-Calculus, Structured Coalgebras, and Minimal HD-Automata , 2000, MFCS.

[19]  Witold Charatonik,et al.  The Decidability of Model Checking Mobile Ambients , 2001, CSL.

[20]  Joost Engelfriet,et al.  Multisets and Structural Congruence of the pi-Calculus with Replication , 1999, Theor. Comput. Sci..

[21]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[22]  Luca Cardelli,et al.  Logical Properties of Name Restriction , 2001, TLCA.

[23]  Davide Sangiorgi,et al.  Separability, expressiveness, and decidability in the ambient logic , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[24]  Giorgio Ghelli,et al.  Decidability of Freshness, Undecidability of Revelation , 2004, FoSSaCS.

[25]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[26]  He Jifeng,et al.  Advances in Computing Science — ASIAN 2000 , 2002, Lecture Notes in Computer Science.

[27]  Lus Caires.  A Model for Declarative Programming and Specification with Concurrency and Mobility , 1999 .

[28]  Witold Charatonik,et al.  Finite-Control Mobile Ambients , 2002, ESOP.

[29]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[30]  Mads Dam.  Proof Systems for π-Calculus Logics , 2003, Logic for Concurrency and Synchronisation.

[31]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[32]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[33]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

[34]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .