On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs

DOI10.3233/FI-2014-1103zbMath1320.68125OpenAlexW1845000419MaRDI QIDQ5259267

Ugo Montanari, Roberto Bruni, 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

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

Related Items (8)

Executing bigraphical reactive systems ⋮ Interacting Hopf algebras ⋮ Free gs-monoidal categories and free Markov categories ⋮ Unnamed Item ⋮ The algebra of partial equivalence relations ⋮ Lawvere Categories as Composed PROPs ⋮ Graphical Conjunctive Queries. ⋮ Bialgebraic foundations for the operational semantics of string diagrams

Uses Software

• Maude

This page was built for publication: On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs