Pure bigraphs: structure and dynamics

DOI10.1016/j.ic.2005.07.003zbMath1093.68067OpenAlexW1969001723MaRDI QIDQ2490119

Arthur J. Milner

Publication date: 28 April 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/15231255/Pure_bigraphs_Structure_and_dynamics.pdf

zbMATH Keywords

bigraphical reactive system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General biology and biomathematics (92B05)

Related Items

Completeness of Nominal PROPs ⋮ Chromar, a rule-based language of parameterised objects ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Basic observables for a calculus for global computing ⋮ Using bigraphs to model topological graphs embedded in orientable surfaces ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ Chromar, a language of parameterised agents ⋮ A decentralised graphical implementation of mobile ambients ⋮ An inductive characterization of matching in binding bigraphs ⋮ Formal modeling of multi-viewpoint ontology alignment by mappings composition ⋮ A Higher-Order Calculus of Computational Fields ⋮ A Decentralized Implementation of Mobile Ambients ⋮ Security, Cryptography and Directed Bigraphs ⋮ Open-graphs and monoidal theories ⋮ Stochastic Bigraphs ⋮ Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) ⋮ RPO semantics for mobile ambients ⋮ Pure bigraphs: structure and dynamics ⋮ The calculus of context-aware ambients ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ On GS-Monoidal Theories for Graphs with Nesting ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ Kind Bigraphs ⋮ A Higher-Order Graph Calculus for Autonomic Computing ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Relational presheaves, change of base and weak simulation ⋮ Directed Bigraphs ⋮ Matching of Bigraphs ⋮ Bigraphs and Their Algebra ⋮ An Algebra for Directed Bigraphs

Uses Software

• SLMC

Cites Work

• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• The lambda calculus, its syntax and semantics
• The chemical abstract machine
• A calculus of mobile processes. I
• Application of a stochastic name-passing calculus to representation and simulation of molecular processes
• Calculi for interaction
• Pure bigraphs: structure and dynamics
• Deriving Bisimulation Congruences: A 2-categorical Approach
• Bigraphs and transitions
• Transition systems, link graphs and Petri nets
• A Theory of Communicating Sequential Processes
• Bisimulation congruences in safe ambients
• Lectures on Concurrency and Petri Nets
• Automata, Languages and Programming
• From rewrite rules to bisimulation congruences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item