Comparing communication primitives via their relative expressive power
type: Item
instance of: scholarly article
title: Comparing communication primitives via their relative expressive power
zbMATH Open document ID: 1169.68009
author: Daniele Gorla
published in: Information and Computation
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5522920
zbMATH Keywords: process calculi
zbMATH Keywords: communication primitives
zbMATH Keywords: relative expressiveness
zbMATH Keywords: encodings
describes a project that uses: Linda
describes a project that uses: PiDuce
describes a project that uses: Pict
describes a project that uses: XPi
MaRDI profile type: Publication
full work available at URL: j.ic.2008.05.001
OpenAlex ID: W1968539782
cites work: XPi: a typed process calculus for XML messaging
cites work: On bisimulations for the asynchronous \(\pi\)-calculus
cites work: An efficiency preorder for processes
cites work: A process algebraic view of Linda coordination primitives
cites work: Comparing three semantics for Linda-like languages
cites work: On the expressiveness of Linda coordination primitives.
cites work: On the expressive power of movement and restriction in pure mobile ambients
cites work: Q4448369
cites work: Separation of synchronous and asynchronous communication via testing
cites work: Q4457838
cites work: Mobile ambients
cites work: Semantic subtyping for the pi-calculus
cites work: Embedding as a tool for language comparison
cites work: On the expressive power of \textsc{Klaim}-based calculi
cites work: Pattern Matching over a Dynamic Network of Tuple Spaces
cites work: Q4934334
cites work: Q4536436
cites work: Generative communication in Linda
cites work: Foundations of Software Science and Computation Structures
cites work: Synchrony vs asynchrony in communication primitives
cites work: On reduction-based process semantics
cites work: Q3992568
cites work: A calculus of mobile processes. I
cites work: Barbed bisimulation
cites work: What is a ``good'' encoding of guarded choice?
cites work: Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
cites work: Decoding choice encodings
cites work: An introduction to the \(\pi\)-calculus.
cites work: Expressiveness of process algebras
cites work: Programming Languages and Systems
cites work: Q4513619
cites work: Q4508309
cites work: Types and full abstraction for polyadic \(\pi\)-calculus
cites work: Bisimulation for higher-order process calculi
cites work: Q4535034
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: Q4223015
DOI: 10.1016/J.IC.2008.05.001
description: scientific article; zbMATH DE number 5522920