AbstractMatching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic synchronisation of all finite levels
AbstractIn Honda and Yoshida (TACS’94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin...
We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for ...
We give a labeled characterization of barbed congruence in asynchronous pi-calculus, which, unlike p...
AbstractMatching systems were introduced by Carbone and Maffeis, and used to investigate the express...
We present two novel semantics for pi-calculus. The first allows one to observe on which channel a s...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a ...
Abstract. This paper compares the expressiveness of ambient calculi against different dialects of th...
Chi and Update calculi have been independently introduced in order to model mobile systems. The two ...
The expressiveness of communication primitives has been explored in a common framework based on the ...
We give a divergence-free encoding of polyadic Local pi into its monadic variant. Local pi is a sub-...
The Asynchronous ß-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro,...
The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding...
International audienceIn a well-known and influential paper [17] Palamidessi has shown that the expr...
We investigate translations from the synchronous pi-calculus into a core language of Concurrent Has...
AbstractIn Honda and Yoshida (TACS’94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin...
We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for ...
We give a labeled characterization of barbed congruence in asynchronous pi-calculus, which, unlike p...
AbstractMatching systems were introduced by Carbone and Maffeis, and used to investigate the express...
We present two novel semantics for pi-calculus. The first allows one to observe on which channel a s...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a ...
Abstract. This paper compares the expressiveness of ambient calculi against different dialects of th...
Chi and Update calculi have been independently introduced in order to model mobile systems. The two ...
The expressiveness of communication primitives has been explored in a common framework based on the ...
We give a divergence-free encoding of polyadic Local pi into its monadic variant. Local pi is a sub-...
The Asynchronous ß-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro,...
The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding...
International audienceIn a well-known and influential paper [17] Palamidessi has shown that the expr...
We investigate translations from the synchronous pi-calculus into a core language of Concurrent Has...
AbstractIn Honda and Yoshida (TACS’94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin...
We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for ...
We give a labeled characterization of barbed congruence in asynchronous pi-calculus, which, unlike p...
DOI
Add to ORKG