An inductive characterization of matching in binding bigraphs

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.

[1]  Lars Birkedal,et al.  Sortings for Reactive Systems , 2006, CONCUR.

[2]  Robin Milner,et al.  Axioms for bigraphical structure , 2005, Mathematical Structures in Computer Science.

[3]  Robin Milner,et al.  Transition systems, link graphs and Petri nets , 2006, Mathematical Structures in Computer Science.

[4]  Robin Milner,et al.  The Space and Motion of Communicating Agents , 2009 .

[5]  Thomas T. Hildebrandt,et al.  Bigraphical Programming Languages for Pervasive Computing , 2006 .

[6]  Dániel Varró,et al.  Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans , 2006, GRaMoT@GPCE.

[7]  Gabriel Valiente,et al.  Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[8]  Lars Birkedal,et al.  Bigraphical Models of Context-Aware Systems , 2006, FoSSaCS.

[9]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

[10]  Stanley M. Selkow,et al.  The Tree-to-Tree Editing Problem , 1977, Inf. Process. Lett..

[11]  Lars Birkedal,et al.  An Implementation of Bigraph Matching , 2008 .

[12]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[13]  Albert Zündorf,et al.  Graph Pattern Matching in PROGRES , 1994, TAGT.

[14]  Lars Birkedal,et al.  Syntactic Theory for Bigraphs , 2006 .

[15]  Luca Aceto,et al.  Foundations of Software Science and Computation Structures , 2006, Lecture Notes in Computer Science.

[16]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[17]  Robin Milner,et al.  Matching of Bigraphs , 2007, GT-VC@CONCUR.

[18]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[19]  Lars Birkedal,et al.  Axiomatizing Binding Bigraphs , 2006, Nord. J. Comput..

[20]  Ron Shamir,et al.  Faster subtree isomorphism , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[21]  Javier Larrosa,et al.  Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.

[22]  Robin Milner,et al.  Bigraphs whose names have multiple locality , 2004 .

[23]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

[24]  James Jianghai Fu,et al.  Directed Graph Pattern Matching and Topological Embedding , 1997, J. Algorithms.