What is a ``good'' encoding of guarded choice?
type: Item
instance of: scholarly article
title: What is a ``good'' encoding of guarded choice?
zbMATH Open document ID: 1046.68625
author: Uwe Nestmann
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1853088
zbMATH Keywords: \(\pi\)-calculus
zbMATH Keywords: strong compositionality
zbMATH Keywords: divergence-freedom
MaRDI profile type: Publication
OpenAlex ID: W2029133311
cites work: On bisimulations for the asynchronous \(\pi\)-calculus
cites work: An efficiency preorder for processes
cites work: On modelling mobility
cites work: Q4222913
cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
cites work: An Effective Implementation for the Generalized Input-Output Construct of CSP
cites work: On the \(\pi\)-calculus and linear logic
cites work: Q4219054
cites work: A counter-example to an algorithm for the generalized input--output construct of CSP
cites work: A new solution of Dijkstra's concurrent programming problem
cites work: A calculus of mobile processes. II
cites work: Barbed bisimulation
cites work: Decoding choice encodings
cites work: Q3837262
cites work: The name discipline of uniform receptiveness
cites work: Constraints as processes
DOI: 10.1006/INCO.1999.2822
description: scientific article; zbMATH DE number 1853088