An inductive characterization of matching in binding bigraphs

DOI10.1007/s00165-011-0184-5zbMath1259.68157OpenAlexW2084135842MaRDI QIDQ1941899

Lars Birkedal, Troels C. Damgaard, Arne J. Glenstrup, Arthur J. Milner

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-011-0184-5

zbMATH Keywords

matchingbigraphsbigraphical reactive systemscomplete inductive characterization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Executing bigraphical reactive systems ⋮ Computing Embeddings of Directed Bigraphs ⋮ Finding a Forest in a Tree

Cites Work

• Unnamed Item
• Unnamed Item
• The tree-to-tree editing problem
• Pure bigraphs: structure and dynamics
• Fundamentals of algebraic graph transformation
• Matching of Bigraphs
• Directed Graph Pattern Matching and Topological Embedding
• Axioms for bigraphical structure
• Transition systems, link graphs and Petri nets
• The Space and Motion of Communicating Agents
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• Faster Subtree Isomorphism
• Sortings for Reactive Systems
• Foundations of Software Science and Computation Structures

This page was built for publication: An inductive characterization of matching in binding bigraphs