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

DOI10.3233/FI-2014-1103MaRDI QIDQ5259267zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(12)

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

Describes a project that uses

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)