Bigraphs and Their Algebra

DOI10.1016/j.entcs.2008.04.002zbMath1279.68263OpenAlexW2106465916WikidataQ30054156 ScholiaQ30054156MaRDI QIDQ2870188

Arthur J. Milner

Publication date: 17 January 2014

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.2008.04.002

zbMATH Keywords

process calculibigraphs

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 (3)

Formal modeling of multi-viewpoint ontology alignment by mappings composition ⋮ Unnamed Item ⋮ Relations between adjacency trees

Uses Software

• Maude

Cites Work

• Maude
• Conditional rewriting logic as a unified model of concurrency
• Calculi for interaction
• Pure bigraphs: structure and dynamics
• Deriving Bisimulation Congruences: A 2-categorical Approach
• Bigraphs and transitions
• Axioms for bigraphical structure
• Transition systems, link graphs and Petri nets
• Rule-Based Modelling of Cellular Signalling
• Stochastic Bigraphs
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bigraphs and Their Algebra