Results 1  10
of
11
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 88 (14 self)
 Add to MetaCart
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.
Subtyping and Locality in Distributed Higher Order Processes (Extended Abstract)
, 1999
"... . This paper studies one important aspect of distributed systems, locality, using a calculus of distributed higherorder processes in which not only basic values or channels, but also parameterised processes are transferred across distinct locations. An integration of the subtyping of lcalculus a ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
. This paper studies one important aspect of distributed systems, locality, using a calculus of distributed higherorder processes in which not only basic values or channels, but also parameterised processes are transferred across distinct locations. An integration of the subtyping of lcalculus and IOsubtyping of the pcalculus offers a tractable tool to control the locality of channel names in the presence of distributed higher order processes. Using a local restriction on channel capabilities together with a subtyping relation, locality is preserved during reductions even if we allow new receptors to be dynamically created by instantiation of arbitrary higherorder values and processes. We also show that our method is applicable to more general constraints, based on local and global channel capabilities. 1 Introduction There have been a number of attempts at adapting traditional process calculi, such as CCS and CSP, so as to provide support for the modelling of certain asp...
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.
On Equators in Asynchronous Namepassing Calculi without Matching (Extended Abstract)
, 1999
"... We give a labeled characterization of barbed congruence in asynchronous calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous calculus the fact that two names are indisting ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We give a labeled characterization of barbed congruence in asynchronous calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous calculus the fact that two names are indistinguishable can be modeled by means of Honda and Yoshida's notion of equator. Our labeled characterization is based on such a notion. As an application of our theory we provide a fully abstract encoding w.r.t. barbed congruence of external mobility (communication of free names) in terms of internal mobility (communication of private names).
A Calculus for Interaction Nets
, 1999
"... . Interaction nets are graphical rewriting systems which can be used as either a highlevel programming paradigm or a lowlevel implementation language. However, an operational semantics together with notions of strategy and normal form which are essential to reason about implementations, are not ea ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. Interaction nets are graphical rewriting systems which can be used as either a highlevel programming paradigm or a lowlevel implementation language. However, an operational semantics together with notions of strategy and normal form which are essential to reason about implementations, are not easy to formalize in this graphical framework. The purpose of this paper is to study a textual calculus for interaction nets, with a formal operational semantics, which provides a foundation for implementation. In addition, we are able to specify in this calculus various strategies, and a type system which formalizes the notion of partition used to define semisimple nets. The resulting system can be seen as a kernel for a programming language, analogous to the calculus. 1 Introduction Interaction nets, introduced by Lafont [12], offer a graphical paradigm of computation based on net rewriting. They have proven themselves successful for application in computer science, most notably with the ...
Symmetric Action Calculi
 Theoretical Computer Science
, 1999
"... Many calculi for describing interactive behaviour involve names, nameabstraction and namerestriction. Milner's reflexive action calculi provide a framework for exploring such calculi. It is based on names and nameabstraction. We introduce an alternative framework, the symmetric action calculi, ba ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Many calculi for describing interactive behaviour involve names, nameabstraction and namerestriction. Milner's reflexive action calculi provide a framework for exploring such calculi. It is based on names and nameabstraction. We introduce an alternative framework, the symmetric action calculi, based on names, conames and namerestriction (or hiding). Nameabstraction is intepreted as a derived operator. The symmetric framework conservatively extends the reflexive framework. It allows for a natural intepretation of a variety of calculi: we give interpretations for the calculus, the I calculus and a variant of the fusion calculus. We then give a combinatory version of the symmetric framework, in which namerestriction also is expressed as a derived operator. This combinatory account provides an intermediate step between our nonstandard use of names in graphs, and the more standard graphical structure arising from category theory. To conclude, we briey illustrate the connection ...
Access Control Based on Code Identity for Open Distributed Systems
"... Abstract. In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behavior of an agent. We study the relationship between code identity, static analysis and trust in open distribute ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behavior of an agent. We study the relationship between code identity, static analysis and trust in open distributed systems. Our primary result is a robust safety theorem expressed in terms of a distributed higherorder picalculus with code identity and a primitive for remote attestation; types in the language make use of a rich specification language for access control policies.
Welcome to the Jungle A subjective guide to mobile process calculi
"... Abstract. Almost 30 years ago, the research on process calculi gained a lot of momentum with the invention of ACP, CCS and CSP. Later on, but also already 20 years ago, researchers started to consider socalled mobile variants of process calculi, in which communication channels were themselves treat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Almost 30 years ago, the research on process calculi gained a lot of momentum with the invention of ACP, CCS and CSP. Later on, but also already 20 years ago, researchers started to consider socalled mobile variants of process calculi, in which communication channels were themselves treated as the exchanged data. The original Pi Calculus arose out of a reformulation and extension of CCS. In turn, it boosted the invention and study of a whole zoo of further process calculi. In this tutorial, we provide a bird’seye view on the jungle of results, techniques and subtleties about mobile process calculi. Next to a rough overview on the zoo of calculi, this includes the coverage of both semantic and pragmatic aspects, ranging from notions of equivalence and expressiveness to challenging application domains. Disclaimer This document does not intend to constitute yet another, possibly updated bibliographic article about mobile process calculi. There have been several already. To my knowledge, Kohei Honda did the first one in 1998, published online. Silvano DalZilio did another one in 2001 [Dal01], integrating references to “truly mobile ” calculi reminiscent of Mobile Ambients. Finally, during the years 1994– 2003, Björn Victor and I actively comaintained an online bibliography and web pages on the topic of Calculi for Mobile Processes [NV98]. When we stopped updating the bibfiles, the corresponding L ATEX’ed version of the complete bibliography was 29 pages long, of course not even being complete at that time. This document neither intends to constitute a typical technical tutoriallike introduction to mobile process calculi. There have been several already. The usual suspects that I would recommend are the ones listed on the mobility web pages, carefully written by Milner et. al. [MPW92,Mil99], Parrow [Par01],
Raymond Hu Concurrent Combinators for Mobile Processes
"... 1.1 Process Calculi.................................. 1 1.2 Concurrent Combinators [2]........................... 2 ..."
Abstract
 Add to MetaCart
1.1 Process Calculi.................................. 1 1.2 Concurrent Combinators [2]........................... 2
Localité Dans Le PiCalcul Et Applications Aux . . .
, 2000
"... This thesis is concerned with the calculus, the prototypical namepassing calculus of mobile processes, i.e. processes with a dynamically changing communication topology. Through the years, several variants and/or subcalculi of the calculus have been proposed to naturally model, and prove properti ..."
Abstract
 Add to MetaCart
This thesis is concerned with the calculus, the prototypical namepassing calculus of mobile processes, i.e. processes with a dynamically changing communication topology. Through the years, several variants and/or subcalculi of the calculus have been proposed to naturally model, and prove properties of, important classes of distributed concurrent systems. We introduce the Local calculus, L, an asynchronous variant of the calculus, where the process receiving a name may only use it in output actions. L can be seen as a simple basis of concurrent and/or distributed languages such as Pict and Join. We study the foundational theory of L. The behavioural equivalence we adopt in the calculus is barbed congruence. We give two labelled bisimilarities which characterise barbed congruence in L. The first is based on an embedding of L into a subcalculus where all names emitted are private. The second is based on a new labelled transition system which reveals what is observable in L. Our bisimilarities form congruence relations and can be enhanced by means of upto proof techniques. In the characterisation proofs, no matching construct for testing equality between names is used. One of the main motivations of L is its rich algebraic theory. A certain number of applications of this theory is presented, including a fullyabstract encoding of polyadic L into monadic L. Much of the theory of L is generalised to the asynchronous , a , in which there is no constraint on received names. Applications of this new theory of a include: (i) a fullyabstract encoding of external mobility (global names are communicated) in terms of internal mobility (only private names are communicated); (ii) a fullyabstract encoding of an asynchronous variant of the Fusion calculus into a . Finally...