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
2005
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.
32th International Colloquium on Automata, Languages and Programming, ICALP 2005..
.
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.
Text
biLogICALPoff.pdf
- Other
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: 14 Mar 2024 07:09
Export record
Contributors
Author:
G. Conforti
Author:
D. Macedonio
Author:
V. Sassone
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