The following pages link to Bigraphs and transitions (Q2942911):
Displayed 24 items.
- A decentralised graphical implementation of mobile ambients (Q624388) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- Locating reaction with 2-categories (Q1770420) (← links)
- Deriving structural labelled transitions for mobile ambients (Q1959484) (← links)
- Pure bigraphs: structure and dynamics (Q2490119) (← links)
- Concurrent nets: a study of prefixing in process calculi (Q2491636) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Dynamic input/output automata: a formal and compositional model for dynamic systems (Q2629850) (← links)
- Finding a Forest in a Tree (Q2811922) (← links)
- (Q2851048) (← links)
- Local Bigraphs and Confluence: Two Conjectures (Q2866344) (← links)
- Bigraphs and Their Algebra (Q2870188) (← links)
- DBtk: A Toolkit for Directed Bigraphs (Q2888502) (← links)
- Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi (Q3184728) (← links)
- Graph-Based Design and Analysis of Dynamic Software Architectures (Q3507356) (← links)
- A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
- Reactive Systems, Barbed Semantics, and the Mobile Ambients (Q3617735) (← links)
- Kind Bigraphs (Q4982073) (← links)
- (Q5028460) (← links)
- Computing Embeddings of Directed Bigraphs (Q5100725) (← links)
- Hierarchical Design Rewriting with Maude (Q5179129) (← links)