Pure bigraphs: structure and dynamics
From MaRDI portal
Publication:2490119
Recommendations
Cites work
- A calculus of communicating systems
- A calculus of mobile processes. I
- A Theory of Communicating Sequential Processes
- Algebra of communicating processes with abstraction
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes
- Automata, Languages and Programming
- Bigraphs and transitions
- Bisimulation congruences in safe ambients
- Calculi for interaction
- Deriving bisimulation congruences: a 2-categorical approach
- From rewrite rules to bisimulation congruences
- scientific article; zbMATH DE number 5604061 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1956646 (Why is no real title available?)
- scientific article; zbMATH DE number 2038740 (Why is no real title available?)
- scientific article; zbMATH DE number 1497812 (Why is no real title available?)
- scientific article; zbMATH DE number 1512612 (Why is no real title available?)
- scientific article; zbMATH DE number 1759424 (Why is no real title available?)
- scientific article; zbMATH DE number 1759603 (Why is no real title available?)
- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- scientific article; zbMATH DE number 1863157 (Why is no real title available?)
- scientific article; zbMATH DE number 1863162 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2242579 (Why is no real title available?)
- Lectures on Concurrency and Petri Nets
- Process algebras with localities.
- Pure bigraphs: structure and dynamics
- The chemical abstract machine
- The lambda calculus, its syntax and semantics
- Transition systems, link graphs and Petri nets
Cited in
(55)- Synthesising CCS bisimulation using graph rewriting
- Executing bigraphical reactive systems
- An inductive characterization of matching in binding bigraphs
- A tale of two graph models: a case study in wireless sensor networks
- Chromar, a rule-based language of parameterised objects
- Bigraphs with sharing
- Relational presheaves, change of base and weak simulation
- Basic observables for a calculus for global computing
- Chromar, a language of parameterised agents
- Pure bigraphs: structure and dynamics
- Survey on bigraph and its applications
- Local bigraphs and confluence: two conjectures (extended abstract)
- Matching of bigraphs
- Bigraphs and their algebra
- An algebra for directed bigraphs
- Bigraphs and transitions
- A General Theory of Barbs, Contexts, and Labels
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- On GS-monoidal theories for graphs with nesting
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- Encoding Asynchronous Interactions Using Open Petri Nets
- Axioms for bigraphical structure
- Bigraphical nets
- Axiomatizing binding bigraphs
- Reactive Systems over Directed Bigraphs
- A Decentralized Implementation of Mobile Ambients
- Security, Cryptography and Directed Bigraphs
- On the Construction of Sorted Reactive Systems
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- A higher-order graph calculus for autonomic computing
- Using bigraphs to model topological graphs embedded in orientable surfaces
- A higher-order calculus of computational fields
- scientific article; zbMATH DE number 2163006 (Why is no real title available?)
- scientific article; zbMATH DE number 1863157 (Why is no real title available?)
- Open-graphs and monoidal theories
- Kind Bigraphs
- Conditional bigraphs
- Computing embeddings of directed bigraphs
- Labelled transitions for mobile ambients (as synthesized via a graphical encoding)
- On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs
- Directed bigraphs
- Stochastic bigraphs
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- Lectures on Concurrency and Petri Nets
- Automata, Languages and Programming
- RPO semantics for mobile ambients
- Completeness of Nominal PROPs
- Foundations of Software Science and Computation Structures
- Probabilistic Bigraphs
- Formal modeling of multi-viewpoint ontology alignment by mappings composition
- A decentralised graphical implementation of mobile ambients
- Fuzzy bigraphs
- A bigraph relational model
- The calculus of context-aware ambients
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
This page was built for publication: Pure bigraphs: structure and dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490119)