On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs

DOI10.3233/FI-2014-1103zbMATH Open1320.68125OpenAlexW1845000419MaRDI QIDQ5259267FDOQ5259267

Authors: Roberto Bruni, Ugo Montanari, Daniele Terreni, Gordon D. Plotkin 

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1103

Recommendations

• Pure bigraphs: structure and dynamics
• Bigraphs and their algebra
• GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
• Directed bigraphs
• On GS-monoidal theories for graphs with nesting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (12)

• Graphical Conjunctive Queries.
• Multilevel System as Multigraph
• The algebra of partial equivalence relations
• Title not available (Why is that?)
• Lawvere categories as composed PROPs
• Executing bigraphical reactive systems
• Interacting Hopf algebras
• An algebraic presentation of term graphs, via gs-monoidal categories
• Free gs-monoidal categories and free Markov categories
• Bialgebraic foundations for the operational semantics of string diagrams
• GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
• On GS-monoidal theories for graphs with nesting

Uses Software

• Maude

This page was built for publication: On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs

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