Separation of synchronous and asynchronous communication via testing

Authors:
D. Cacciagrano;F. Corradini;C. Palamidessi
Affiliations:
Dipartimento di Matematica e Informatica, Università degli Studi di Camerino, Via Madonna delle Carceri 9, Camerino, Italy;Dipartimento di Matematica e Informatica, Università degli Studi di Camerino, Via Madonna delle Carceri 9, Camerino, Italy;INRIA Futurs and LIX, École Polytechnique, Rue de Saclay, Palaiseau Cedex, France
Venue:
Theoretical Computer Science
Year:
2007

Citing 13
Cited 4

Algebraic theory of processes

Algebraic theory of processes
A calculus of mobile processes, I

Information and Computation
Testing equivalence for mobile processes

Information and Computation
What is a “good” encoding of guarded choice?

Information and Computation - Special issue on EXPRESS 1997
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Divergence and Fair Testing

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Synchronous and Asynchronous Communication Paradigms

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Fair Testing

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Testing Theories for Asynchronous Languages

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

Mathematical Structures in Computer Science
On the expressive power of KLAIM-based calculi

Theoretical Computer Science - Expressiveness in concurrency
Fair Π

Electronic Notes in Theoretical Computer Science (ENTCS)

Tutorial on separation results in process calculi via leader election problems

Theoretical Computer Science
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Towards a unified approach to encodability and separation results for process calculi

Information and Computation
On the expressiveness of polyadic and synchronous communication in higher-order process calculi

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Quantified Score

Hi-index	5.23

Visualization

Abstract

One of the early results concerning the asynchronous @p-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) @p-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy's testing semantics. In this sense, it turns out that, under some general conditions, no encoding of the output prefix is able to preserve the must testing. This negative result is due to (a) the non-atomicity of the sequences of steps which are necessary in the asynchronous @p-calculus to mimic synchronous communication, and (b) testing semantics' sensitivity to divergence.