Minimality Results for the Spatial Logics

A spatial logic consists of four groups of operators: standard propositional connectives; spatial operators; a temporal modality; calculus-specific operators. The calculus-specific operators talk about the capabilities of the processes of the calculus, that is, the process constructors through which a process can interact with its environment. We prove some minimality results for spatial logics. The main results show that in the logics for π-calculus and asynchronous π-calculus the calculus-specific operators can be eliminated. The results are presented under both the strong and the weak interpretations of the temporal modality. Our proof techniques are applicable to other spatial logics, so to eliminate some of – if not all – the calculus-specific operators. As an example of this, we consider the logic for the Ambient calculus, with the strong semantics.

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

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

[3]  G. Plotkin,et al.  Proof, language, and interaction: essays in honour of Robin Milner , 2000 .

[4]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[5]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[6]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1999 .

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

[8]  Nadia Busi,et al.  On the Expressiveness of Movement in Pure Mobile Ambients , 2002, Electron. Notes Theor. Comput. Sci..

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

[10]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

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

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

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

[14]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[15]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.