Towards a unified approach to encodability and separation results for process calculi

D Gorla - Information and Computation, 2010 - Elsevier
We present a unified approach to evaluate the relative expressive power of process calculi.
In particular, we identify a small set of criteria (that have already been somehow presented …

Fencing off go: liveness and safety for channel-based programming

J Lange, N Ng, B Toninho, N Yoshida - ACM SIGPLAN Notices, 2017 - dl.acm.org
Go is a production-level statically typed programming language whose design features
explicit message-passing primitives and lightweight threads, enabling (and encouraging) …

On the expressiveness and decidability of higher-order process calculi

I Lanese, JA Pérez, D Sangiorgi, A Schmitt - Information and Computation, 2011 - Elsevier
In higher-order process calculi, the values exchanged in communications may contain
processes. A core calculus of higher-order concurrency is studied; it has only the operators …

On the expressiveness of interaction

Y Fu, H Lu - Theoretical Computer Science, 2010 - Elsevier
Subbisimilarity is proposed as a general tool to classify the relative expressive power of
process calculi. The expressiveness of several variants of CCS is compared in terms of the …

On the expressive power of recursion, replication and iteration in process calculi

N Busi, M Gabbrielli, G Zavattaro - Mathematical Structures in …, 2009 - cambridge.org
In this paper we investigate the expressive power of three alternative approaches to the
definition of infinite behaviours in process calculi, namely, recursive definitions, replication …

Musings on encodings and expressiveness

R van Glabbeek - arxiv preprint arxiv:1208.2750, 2012 - arxiv.org
This paper proposes a definition of what it means for one system description language to
encode another one, thereby enabling an ordering of system description languages with …

[HTML][HTML] Theory of interaction

Y Fu - Theoretical Computer Science, 2016 - Elsevier
Abstract Theory of Interaction aims to provide a foundational framework for computation and
interaction. It proposes four fundamental principles that characterize the common features of …

Forward analysis of depth-bounded processes

T Wies, D Zufferey, TA Henzinger - … , FOSSACS 2010, Held as Part of the …, 2010 - Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for
which interesting verification problems are still decidable. In this paper we develop an …

Towards a unified approach to encodability and separation results for process calculi

D Gorla - International Conference on Concurrency Theory, 2008 - Springer
In this paper, we present a unified approach to evaluating the relative expressive power of
process calculi. In particular, we identify a small set of criteria (that have already been …

On the expressive power of process interruption and compensation

M Bravetti, G Zavattaro - Mathematical Structures in Computer …, 2009 - cambridge.org
The investigation into the foundational aspects of linguistic mechanisms for programming
long-running transactions (such as the scope operator of WS-BPEL) has recently renewed …