Static BiLog: a Unifying Language for Spatial Structures

Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework we consider bigraphs, which are emerging as a an interesting (meta-)model for spatial structures and distributed calculi. Since bigraphs are built orthogonally on two structures, a hierarchical place graph for locations and a link (hyper-)graph for connections, we obtain a logic that is a natural composition of other two instances of BiLog: a Place Graph Logic and a Link Graph Logic. We prove that these instances generalise the spatial logics for trees, for graphs and for tree contexts. We also explore the concepts of separation and sharing in these logics. We note that both the operator m of Separation Logic and the operator * of spatial logics do not completely separate the underlying structures. These two different forms of separation can be naturally derived as instances of BiLog by using the complete separation induced by the tensor product of monoidal categories along with some form of sharing.

[1]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[2]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[3]  Vladimiro Sassone,et al.  BiLog: Spatial Logics for Bigraphs , 2006 .

[4]  Damiano Macedonio,et al.  Logics for distributed resources , 2006 .

[5]  Lars Birkedal,et al.  Sortings for Reactive Systems , 2006, CONCUR.

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

[7]  Philippa Gardner,et al.  Context logic and tree update , 2005, POPL '05.

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

[9]  Robin Milner,et al.  Bigraphs for Petri Nets , 2003, Lectures on Concurrency and Petri Nets.

[10]  Vladimiro Sassone,et al.  Spatial Logics for Bigraphs , 2005, ICALP.

[11]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[12]  Marino Miculan,et al.  Directed Bigraphs , 2007, MFPS.

[13]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

[14]  Lars Birkedal,et al.  Bigraphical Models of Context-Aware Systems , 2006, FoSSaCS.

[15]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[16]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[17]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2003, TLDI '03.

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

[19]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.

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

[21]  Lars Birkedal,et al.  Axiomatizing Binding Bigraphs , 2006, Nord. J. Comput..

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

[23]  Philippa Gardner,et al.  A Context Logic for Tree Update , 2004 .

[24]  Robin Milner,et al.  Axioms for bigraphical structure , 2005, Mathematical Structures in Computer Science.

[25]  Daniel Hirschkoff,et al.  An Extensional Spatial Logic for Mobile Processes , 2004, CONCUR.

[26]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..