Deriving Structural Labelled Transitions for Mobile Ambients

DOI10.1007/978-3-540-85361-9_36zbMath1160.68474OpenAlexW2098149321MaRDI QIDQ3541038

Paweł Sobociński, Julian Rathke

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/266825/1/concurFinal.pdf

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ Measurable stochastics for Brane calculus ⋮ Deriving structural labelled transitions for mobile ambients ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ On the Semantics of Markov Automata ⋮ Making the Unobservable, Unobservable ⋮ Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) ⋮ RPO semantics for mobile ambients ⋮ Relating reasoning methodologies in linear logic and process algebra ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Applying a testing approach to the Calculus of Fair Ambients

This page was built for publication: Deriving Structural Labelled Transitions for Mobile Ambients