Bigraphs and transitions
From MaRDI portal
Publication:2942911
DOI10.1145/604131.604135zbMath1321.68126OpenAlexW1971095420MaRDI QIDQ2942911
Ole Høgh Jensen, Arthur J. Milner
Publication date: 11 September 2015
Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/604131.604135
Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
DBtk: A Toolkit for Directed Bigraphs ⋮ Dynamic input/output automata: a formal and compositional model for dynamic systems ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi ⋮ Computing Embeddings of Directed Bigraphs ⋮ A decentralised graphical implementation of mobile ambients ⋮ Graph-Based Design and Analysis of Dynamic Software Architectures ⋮ Deriving structural labelled transitions for mobile ambients ⋮ Unnamed Item ⋮ A Decentralized Implementation of Mobile Ambients ⋮ Unnamed Item ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ Pure bigraphs: structure and dynamics ⋮ Hierarchical Design Rewriting with Maude ⋮ Concurrent nets: a study of prefixing in process calculi ⋮ Locating reaction with 2-categories ⋮ Interpreting a finitary pi-calculus in differential interaction nets ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Finding a Forest in a Tree ⋮ Kind Bigraphs ⋮ A general framework for types in graph rewriting ⋮ Local Bigraphs and Confluence: Two Conjectures ⋮ Bigraphs and Their Algebra
Uses Software
Cites Work
