Results 1  10
of
10
Bisimulations in the joincalculus
 Theoretical Computer Science
, 1998
"... We propose an objectoriented calculus with internal concurrency and classbased inheritance that is built upon the join calculus. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages. Classes are partial message definitions that can be combined and transforme ..."
Abstract

Cited by 51 (7 self)
 Add to MetaCart
We propose an objectoriented calculus with internal concurrency and classbased inheritance that is built upon the join calculus. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages. Classes are partial message definitions that can be combined and transformed. We design operators for behavioral and synchronization inheritance. We also give a type system that statically enforces basic safety properties. Our model is compatible with the JoCaml implementation
On the Expressive Power of Polyadic Synchronisation in πCalculus
, 2003
"... We extend the πcalculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of πcalculus, we suggest that it permits divergencefree encodings of distributed calculi, and w ..."
Abstract

Cited by 29 (9 self)
 Add to MetaCart
We extend the πcalculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of πcalculus, we suggest that it permits divergencefree encodings of distributed calculi, and we show that a limited form of polyadic synchronisation can be encoded weakly in πcalculus. After showing that matching cannot be derived in πcalculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation of a language increases its expressive power by means of a separation result in the style of Palamidessi's result for mixed choice.
Probabilistic Asynchronous πCalculus
 PROCEEDINGS OF 3RD INTERNATIONAL CONFERENCE ON FOUNDATIONS OF SCIENCE AND COMPUTATION STRUCTURES (FOSSACS
, 2000
"... We propose an extension of the asynchronous πcalculus with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distiction ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
(Show Context)
We propose an extension of the asynchronous πcalculus with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distiction
The Expressive Power of Synchronizations
"... A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more processes simultaneously. We demonstrate the nonexistence of a uniform, fully distributed translation of Milner’s CCS with sy ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more processes simultaneously. We demonstrate the nonexistence of a uniform, fully distributed translation of Milner’s CCS with synchronizations of n + 1 processes into CCS with synchronizations of n processes that retains a “reasonable ” semantics. We then extend our study to CCS with symmetric synchronizations allowing a process to perform both inputs and outputs at the same time. We demonstrate that synchronizations containing more than three input/output items are encodable in those with three items, while there is an expressivity gap between three and two. 1.
On the Expressive Power of Polyadic . . .
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2002
"... We extend the #calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of #calculus, and makes it possible to derive divergencefree encodings of distributed calculi. ..."
Abstract
 Add to MetaCart
We extend the #calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of #calculus, and makes it possible to derive divergencefree encodings of distributed calculi. We give a separation result between the #calculus with polyadic synchronisation ( #) and the original calculus, in the style of an analogous result given by Palamidessi for mixed choice. We encode Local Area # showing how to control the local use of resources in #.
Information Society Technologies
"... this document, MyThS will therefore contribute to a broad range of the Commission's IST programme technical, economical and social objectives. Among these, we mention: to bring the benefits of the Information Society within the reach of all Europeans, to promote the takeup of essential technol ..."
Abstract
 Add to MetaCart
this document, MyThS will therefore contribute to a broad range of the Commission's IST programme technical, economical and social objectives. Among these, we mention: to bring the benefits of the Information Society within the reach of all Europeans, to promote the takeup of essential technologies and infrastructures and broaden their applications, to promote the adoption of open standards and open source software. In particular, the di#usion of a secure use of the network will lead to new business opportunities, new ways of work and interaction between citizens and administrations
On Calculi For Mobility And Trust
, 2002
"... This progress report covers two different parts within Global Computing. In the first part we extend the pcalculus with polyadic synchronisation, a generalisation of the communication mechanism allowing the channel names to be composite. We show that this operator embeds nicely in the theory of pc ..."
Abstract
 Add to MetaCart
(Show Context)
This progress report covers two different parts within Global Computing. In the first part we extend the pcalculus with polyadic synchronisation, a generalisation of the communication mechanism allowing the channel names to be composite. We show that this operator embeds nicely in the theory of pcalculus, and makes it possible to derive divergencefree, uniform encodings of distributed calculi. We give a separation result between pcalculus with polyadic synchronisation ( p) and the original calculus. In the second part we give an early development for modelling trust based systems.
Date of Signature
, 2002
"... In this dissertation, we consider a distributed implementation of the #calculus, more precisely, the version of the #calculus with mixed choice. To this end, we present the probabilistic asynchronous #calculus, which is an extension of the asynchronous # calculus enhanced with a notion of random ..."
Abstract
 Add to MetaCart
(Show Context)
In this dissertation, we consider a distributed implementation of the #calculus, more precisely, the version of the #calculus with mixed choice. To this end, we present the probabilistic asynchronous #calculus, which is an extension of the asynchronous # calculus enhanced with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distinction will allow us to reason about the probabilistic correctness of algorithms under certain schedulers. We show that in this language we can solve the electoral problem, which was proved not possible in the asynchronous #calculus.