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 …
In particular, we identify a small set of criteria (that have already been somehow presented …
Full abstraction for expressiveness: history, myths and facts
What does it mean that an encoding is fully abstract? What does it not mean? In this position
paper, we want to help the reader to evaluate the real benefits of using such a notion when …
paper, we want to help the reader to evaluate the real benefits of using such a notion when …
Comparing process calculi using encodings
K Peters - arxiv preprint arxiv:1908.08633, 2019 - arxiv.org
Encodings or the proof of their absence are the main way to compare process calculi. To
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …
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 …
process calculi. The expressiveness of several variants of CCS is compared in terms of the …
Analysing and comparing encodability criteria
Encodings or the proof of their absence are the main way to compare process calculi. To
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …
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 …
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 …
interaction. It proposes four fundamental principles that characterize the common features of …
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 …
process calculi. In particular, we identify a small set of criteria (that have already been …
[PDF][PDF] A theory of encodings and expressiveness
RJ van Glabbeek - … on Foundations of Software Science and …, 2018 - library.oapen.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 …
encode another one, thereby enabling an ordering of system description languages with …
Comparing the expressiveness of the π-calculus and CCS
R van Glabbeek - ACM Transactions on Computational Logic, 2023 - dl.acm.org
This paper shows that the π-calculus with implicit matching is no more expressive than
CCSγ, a variant of CCS in which the result of a synchronisation of two actions is itself an …
CCSγ, a variant of CCS in which the result of a synchronisation of two actions is itself an …