Matching of Bigraphs

Authors:
Lars Birkedal;Troels Christoffer Damgaard;Arne John Glenstrup;Robin Milner
Affiliations:
IT University of Copenhagen, Denmark;IT University of Copenhagen, Denmark;IT University of Copenhagen, Denmark;University of Cambridge, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 11
Cited 4

Directed graph pattern matching and topological embedding

Journal of Algorithms
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Faster Subtree Isomorphism

Journal of Algorithms
Algorithms on Trees and Graphs

Algorithms on Trees and Graphs
Graph Pattern Matching in PROGRES

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Constraint satisfaction algorithms for graph pattern matching

Mathematical Structures in Computer Science
Axioms for bigraphical structure

Mathematical Structures in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Pure bigraphs: structure and dynamics

Information and Computation
Axiomatizing binding bigraphs

Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Bigraphical models of context-aware systems

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

An Algebra for Directed Bigraphs

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

Electronic Notes in Theoretical Computer Science (ENTCS)
DBtk: a toolkit for directed bigraphs

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Real-time verification of wireless home networks using bigraphs with sharing

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.