Results 1  10
of
21
On Asynchrony in NamePassing Calculi
 In
, 1998
"... The asynchronous picalculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output c ..."
Abstract

Cited by 100 (15 self)
 Add to MetaCart
(Show Context)
The asynchronous picalculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs for testing equality between names. We study the basic operational and algebraic theory of Lpi. We focus on bisimulationbased behavioural equivalences, precisely on barbed congruence. We prove two coinductive characterisations of barbed congruence in Lpi, and some basic algebraic laws. We then show applications of this theory, including: the derivability of delayed input; the correctness of an optimisation of the encoding of callbyname lambdacalculus; the validity of some laws for Join.
Explicit Fusions
, 2000
"... We introduce explicit fusions of names. An explicit fusion is a process that exists concurrently with the rest of the system and enables two names to be used interchangeably. Explicit fusions provide a smallstep account of reaction in process calculi such as the pi calculus and the fusion calcu ..."
Abstract

Cited by 62 (7 self)
 Add to MetaCart
We introduce explicit fusions of names. An explicit fusion is a process that exists concurrently with the rest of the system and enables two names to be used interchangeably. Explicit fusions provide a smallstep account of reaction in process calculi such as the pi calculus and the fusion calculus. In this respect they are similar to the explicit substitutions of Abadi, Cardelli and Curien, which do the same for the lambda calculus. In this paper, we give a technical foundation for explicit fusions. We present the piF calculus, a simple process calculus with explicit fusions, and define a strong bisimulation congruence. We study the embeddings of the fusion calculus and the pi calculus. The former is fully abstract with respect to bisimulation.
Towards a unified approach to encodability and separation results for process calculi
 Proc. of 19th International Conference on Concurrency Theory (CONCUR’08), number 5201 in LNCS
, 2008
"... Abstract. 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 somehow presented in the literature) that an encoding should satisfy to be considered a good means for lan ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
Abstract. 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 somehow presented in the literature) that an encoding should satisfy to be considered a good means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) the best known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because there exist encodings that do not satisfy all the criteria we have proposed; (iii) the best known separation results can be formulated in terms of our criteria; and (iv) some widely believed (but never formally proved) separation results can be proved by using the criteria we propose. Moreover, the way in which we prove known separation results is easier and more uniform than the way in which such results were originally proved. 1
Solo Diagrams
 PROCEEDINGS OF TACS 2001
, 2001
"... We address the problems of implementing the
replication operator efficiently in the solos calculusa calculus of
mobile processes without prefix. This calculus is expressive enough to
admit an encoding of the whole fusion calculus and thus the
picalculus.
We show that nested occurrences of replic ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
We address the problems of implementing the
replication operator efficiently in the solos calculusa calculus of
mobile processes without prefix. This calculus is expressive enough to
admit an encoding of the whole fusion calculus and thus the
picalculus.
We show that nested occurrences of replication can be avoided, that
the size of replicated terms can be limited to three particles, and
that the usual unfolding semantics of replication can be replaced by
three simple reduction rules. To illustrate the results and show how
the calculus can be efficiently implemented we present a graphic
representation of agents in the solos calculus, adapting ideas from
interaction diagrams and pinets.
The fusion machine (Extended Abstract)
 IN PROC. OF CONCUR ’02, LNCS
, 2002
"... We present a new model for the distributed implementation of pilike calculi. This model is a closemos h to a variety of calculi, and so perm02 strong correctness results that are easy to prove. In particular, we describe a distributed abstractms hine called the fusion machnq . In it, only channels ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present a new model for the distributed implementation of pilike calculi. This model is a closemos h to a variety of calculi, and so perm02 strong correctness results that are easy to prove. In particular, we describe a distributed abstractms hine called the fusion machnq . In it, only channels exist at runtim0 It uses aform of concurrent constraints called fusionsequations on channelnaml#0#05 h it stores as trees of forwarders between channels. We imH`B2# t in the fusionms hine a solos calculus with explicit fusions. There are encodings into this calculusfrom the pi calculus and the explicit fusion calculus. We quantify the e#ciency of the latter bymz2# of (co)locations.
Acyclic Solos and Differential Interaction Nets ∗
, 2008
"... We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the picalculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the picalculus. In particular, the induced so ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the picalculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the picalculus. In particular, the induced solo diagrams bear an acyclicity property that induces a faithful encoding into differential interaction nets. This gives a (new) proof that differential interaction nets are expressive enough to contain an encoding of the picalculus. All this is worked out in the case of finitary (replication free) systems without sum, match nor mismatch.
Proofs as executions
, 2012
"... Abstract. This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing corresponding to a particular way of interacting with its environment and cut elimination corresponds to executing the process in a given interaction scenario. A completeness result is established, stating that every lockavoiding execution of a process in some environment corresponds to a particular typing. Besides traces, types contain precise information about the flow of control between a process and its environment, and proofs are interpreted as composable schedulings of processes. In this interpretation, logic appears as a way of making explicit the flow of causality between interacting processes. 1
Namepassing calculi: from fusions to preorders and types (Appendix)
"... A. Reductionclosed barbed congruence (Section II) ..."
(Show Context)
Polyadic HistoryDependent Automata for the Fusion Calculus
, 2003
"... Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus. This lay ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus. This lays the grounds for HDautomatabased tools applicable not only to the monadic πcalculus but also to the fusion calculus and polyadic πcalculus, allowing implementation efforts to be focused at a foundational level rather than being multiplied in several tools. 1