Static BiLog: a Unifying Language for Spatial Structures

  • Authors:

  • Giovanni Conforti;Damiano Macedonio;Vladimiro Sassone

  • Affiliations:

  • DI, Università di Pisa, Italy. E-mail: first6SurnameLetters@di.unipi.it;DSI, Università Ca' Foscari di Venezia, Italy. E-mail: mace@dsi.unive.it;ECS, University of Southampton, UK

  • Venue:
  • Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 ∣ 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.