Matching of bigraphs

DOI10.1016/J.ENTCS.2007.04.013zbMATH Open1278.05184OpenAlexW1976396930WikidataQ126240176 ScholiaQ126240176MaRDI QIDQ2867883FDOQ2867883

Authors: Troels Christoffer Damgaard, Arne John Glenstrup, Lars Birkedal, Robin 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

Recommendations

• An inductive characterization of matching in binding bigraphs
• Conditional bigraphs
• Bigraphs with sharing
• Computing embeddings of directed bigraphs
• Executing bigraphical reactive systems

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)

Cites Work

• An Algorithm for Subgraph Isomorphism
• Title not available (Why is that?)
• Pure bigraphs: structure and dynamics
• Axioms for bigraphical structure
• Directed Graph Pattern Matching and Topological Embedding
• Constraint satisfaction algorithms for graph pattern matching
• Fundamentals of algebraic graph transformation
• The tree-to-tree editing problem
• Foundations of Software Science and Computation Structures
• Faster Subtree Isomorphism
• Transition systems, link graphs and Petri nets
• Axiomatizing binding bigraphs
• Sortings for Reactive Systems

Cited In (7)

• \textsf{DBtk}: a toolkit for directed bigraphs
• Kind Bigraphs
• An inductive characterization of matching in binding bigraphs
• An algebra for directed bigraphs
• Title not available (Why is that?)
• Bigraphs with sharing
• Stochastic Bigraphs

This page was built for publication: Matching of bigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867883)