Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding validity in a spatial logic for trees
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Local Reasoning about Programs that Alter Data Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Local Reasoning about Data Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Extensionality of Spatial Observations in Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Local Reasoning About Tree Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Real-time verification of wireless home networks using bigraphs with sharing
Science of Computer Programming
Towards formalising installation and reconfiguration tasks of AADL architecture
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
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.