The University of Southampton
University of Southampton Institutional Repository

Spatial Logics for Bigraphs

Spatial Logics for Bigraphs
Spatial Logics for Bigraphs
Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical structures, we introduce a general framework for logics whose terms represent arrows in monoidal categories. We then instantiate the framework to bigraphical structures and obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise some known spatial logics for trees, graphs and tree contexts.
bigraph logic, spatial logics, separation logic, bigraphs, context tree logic, context graph logic, monoidal categories
3-540-27580-0
766-778
Conforti, G.
6d02581e-7add-4f16-a1e5-841c88e6b2e2
Macedonio, D.
fd742c8a-820c-4ad2-a72a-94c44171917f
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Conforti, G.
6d02581e-7add-4f16-a1e5-841c88e6b2e2
Macedonio, D.
fd742c8a-820c-4ad2-a72a-94c44171917f
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7

Conforti, G., Macedonio, D. and Sassone, V. (2005) Spatial Logics for Bigraphs At 32th International Colloquium on Automata, Languages and Programming, ICALP 2005.. , pp. 766-778.

Record type: Conference or Workshop Item (Paper)

Abstract

Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical structures, we introduce a general framework for logics whose terms represent arrows in monoidal categories. We then instantiate the framework to bigraphical structures and obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise some known spatial logics for trees, graphs and tree contexts.

PDF biLogICALPoff.pdf - Other
Download (193kB)

More information

Published date: 2005
Venue - Dates: 32th International Colloquium on Automata, Languages and Programming, ICALP 2005., 2005-01-01
Keywords: bigraph logic, spatial logics, separation logic, bigraphs, context tree logic, context graph logic, monoidal categories
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 262304
URI: http://eprints.soton.ac.uk/id/eprint/262304
ISBN: 3-540-27580-0
PURE UUID: 1e505b21-2a02-448c-90c7-db0043755ea8

Catalogue record

Date deposited: 11 Apr 2006
Last modified: 18 Jul 2017 08:52

Export record

Contributors

Author: G. Conforti
Author: D. Macedonio
Author: V. Sassone

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×