Results 1  10
of
11
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 50 (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.
Solos in concert
 IN ICALP’99, LNCS 1644:513–523
, 1999
"... We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but u ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators.
Elementary Structures in Process Theory (1) Sets with Renaming
, 1997
"... We study a general algebraic framework which underlies a wide range of computational formalisms... ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We study a general algebraic framework which underlies a wide range of computational formalisms...
Generating Type Systems for Process Graphs
, 1999
"... We introduce a hypergraphbased process calculus with a generic type system. That is, a type system checking an invariant property of processes can be generated by instantiating the original type system. We demonstrate the key ideas behind the type system, namely that there exists a hypergraph morph ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We introduce a hypergraphbased process calculus with a generic type system. That is, a type system checking an invariant property of processes can be generated by instantiating the original type system. We demonstrate the key ideas behind the type system, namely that there exists a hypergraph morphism from each process graph into its type, and show how it can be used for the analysis of processes. Our examples are input/outputcapabilities, secrecy conditions and avoiding vicious circles occurring in deadlocks. In order to specify the syntax and semantics of the process calculus and the type system, we introduce a method of hypergraph construction using concepts from category theory.
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 4 (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.
On Differential Interaction Nets and the Picalculus
 Preuves, Programmes et Systèmes
, 2006
"... We propose a translation of a finitary (that is, replicationfree) version of the picalculus into promotionfree differential interaction net structures, a linear logic version of the differential lambdacalculus (or, more precisely, of a resource lambdacalculus). For the sake of simplicity only, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a translation of a finitary (that is, replicationfree) version of the picalculus into promotionfree differential interaction net structures, a linear logic version of the differential lambdacalculus (or, more precisely, of a resource lambdacalculus). For the sake of simplicity only, we restrict our attention to a monadic version of the picalculus, so that the differential interaction net structures we consider need only to have exponential cells. We prove that the nets obtained by this translation satisfy an acyclicity criterion weaker than the standard Girard (or DanosRegnier) acyclicity criterion, and we compare the operational semantics of the picalculus, presented by means of an environment machine, and the reduction of differential interaction nets. Differential interaction net structures being of a logical nature, this work provides a CurryHoward interpretation of processes.
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 1 (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.
A Simple piCalculus Manipulation Tool
"... . The ßcalculus is a challenge for tool generation software, as it is subject to frequent changes. A specification of desirable functionality of tools for manipulating ßcalculus expressions is given, and its extensibility is studied. The difficulties encountered during specification are discussed, ..."
Abstract
 Add to MetaCart
. The ßcalculus is a challenge for tool generation software, as it is subject to frequent changes. A specification of desirable functionality of tools for manipulating ßcalculus expressions is given, and its extensibility is studied. The difficulties encountered during specification are discussed, as well as several proposals for easier tool specification. N.B. This paper describes ongoing work: Comments welcome! Key Words & Phrases: ßcalculus, algebraic specification, SOS rules, tool support, tool generation, executable specifications Note: Supported by NWO project HOOP: HigherOrder and ObjectOriented Processes. 1 Introduction 1.1 The ßcalculus The ßcalculus [MPW92] is theory for concurrent behavior. It is a calculus with a very small syntax, and some intuitively easy to understand rules for computation. These rules only involve name passing : Processes can transmit names to each other along named links. This name passing caters for two desirable features: ffl It can be us...