Axioms for bigraphical structure

DOI10.1017/S0960129505004809MaRDI QIDQ3371524zbMATH OpenFDO

Authors Robin Milner

Publication date 21 February 2006

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129505004809

zbMATH Keywords

\(\pi\)-calculusBigraphsPetri nets

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

• Bigraphs and their algebra
• Pure bigraphs: structure and dynamics
• scientific article; zbMATH DE number 1863157
• Axiomatizing binding bigraphs
• Automata, Languages and Programming

Cited in

(12)

• An inductive characterization of matching in binding bigraphs
• Logics for actor networks: a two-stage constrained-hybridisation approach
• Pure bigraphs: structure and dynamics
• Matching of bigraphs
• Bigraphs and their algebra
• An algebra for directed bigraphs
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• Systemic computation: A model of interacting systems with natural characteristics
• Axiomatizing binding bigraphs
• Using bigraphs to model topological graphs embedded in orientable surfaces
• The algebra of directed acyclic graphs
• Automata, Languages and Programming

This page was built for publication: Axioms for bigraphical structure

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