A taxonomy of process calculi for distribution and mobility
type: Item
instance of: scholarly article
title: A taxonomy of process calculi for distribution and mobility
zbMATH Open document ID: 1231.68169
author: Daniele Gorla
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 6003479
zbMATH Keywords: process calculi
zbMATH Keywords: relative expressiveness
zbMATH Keywords: encodings
describes a project that uses: Pict
MaRDI profile type: Publication
full work available at URL: s00446-010-0120-6
OpenAlex ID: W2019329654
cites work: On modelling mobility
cites work: Automata, Languages and Programming
cites work: On an open problem of Amadio and Curien: The finite antichain condition
cites work: Secure implementations of typed channel abstractions
cites work: On the expressive power of movement and restriction in pure mobile ambients
cites work: Q4457838
cites work: Mobile ambients
cites work: Q4532085
cites work: On the expressive power of \textsc{Klaim}-based calculi
cites work: Testing equivalences for processes
cites work: Q4536436
cites work: Safe ambients: Abstract machine and distributed implementation
cites work: Comparing communication primitives via their relative expressive power
cites work: On the relative expressive power of calculi for mobility
cites work: Towards a unified approach to encodability and separation results for process calculi
cites work: A Distributed Pi-Calculus
cites work: Towards a behavioural theory of access and mobility control in distributed systems
cites work: Resource access control in systems of mobile agents
cites work: A generic type system for the Pi-calculus
cites work: A typed encoding of boxed into safe ambients
cites work: On the computational strength of pure ambient calculi
cites work: Q4484495
cites work: Functions as processes
cites work: A calculus of mobile processes. I
cites work: Decoding choice encodings
cites work: What is a ``good'' encoding of guarded choice?
cites work: Expressiveness of process algebras
cites work: Programming Languages and Systems
cites work: Symmetric electoral systems for ambient calculi
cites work: Leader election in rings of ambient processes
cites work: Q3837262
cites work: Semantic Barbs and Biorthogonality
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: Q4219047
cites work: On the Expressiveness of Pure Mobile Ambients
DOI: 10.1007/S00446-010-0120-6
description: scientific article; zbMATH DE number 6003479