Matching of Bigraphs

DOI10.1016/j.entcs.2007.04.013zbMath1278.05184OpenAlexW1976396930WikidataQ126240176 ScholiaQ126240176MaRDI QIDQ2867883

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

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.04.013

zbMATH Keywords

matchingbigraphsbigraphical reactive systemscomplete inductive characterization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

DBtk: A Toolkit for Directed Bigraphs ⋮ An inductive characterization of matching in binding bigraphs ⋮ Stochastic Bigraphs ⋮ Bigraphs with sharing ⋮ An Algebra for Directed Bigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The tree-to-tree editing problem
• Pure bigraphs: structure and dynamics
• Fundamentals of algebraic graph transformation
• Directed Graph Pattern Matching and Topological Embedding
• Axioms for bigraphical structure
• Transition systems, link graphs and Petri nets
• 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: Matching of Bigraphs