Axiomatizing binding bigraphs

Authors:
Troels C. Damgaard;Lars Birkedal
Affiliations:
IT University of Copenhagen, Copenhagen S, Denmark;IT University of Copenhagen, Copenhagen S, Denmark
Venue:
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Year:
2006

Citing 5
Cited 7

Introduction to the Algebraic Theory of Graph Grammars (A Survey)

Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Axioms for bigraphical structure

Mathematical Structures in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

Mathematical Structures 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
Spatial logics for bigraphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Matching of Bigraphs

Electronic Notes in Theoretical Computer Science (ENTCS)
Bigraphs and Their Algebra

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
Type Systems for Bigraphs

Trustworthy Global Computing
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Formalizing higher-order mobile embedded business processes with binding bigraphs

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Static BiLog: a Unifying Language for Spatial Structures

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner's axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner's for pure bigraphs.