Results 1 
8 of
8
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.
Modelling dynamic Web data
 Imperial College London
, 2003
"... We introduce the Xdπ calculus, a peertopeer model for reasoning about dynamic web data. Web data is not just stored statically. Rather it is referenced indirectly, for example using hyperlinks, service calls, or scripts for dynamically accessing data, which require the complex coordination of data ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
We introduce the Xdπ calculus, a peertopeer model for reasoning about dynamic web data. Web data is not just stored statically. Rather it is referenced indirectly, for example using hyperlinks, service calls, or scripts for dynamically accessing data, which require the complex coordination of data and processes between sites. The Xdπ calculus models this coordination, by integrating the XML data structure with process orchestration techniques associated with the distributed picalculus. We study behavioural equivalences for Xdπ, to analyze the various possible patterns of data and process interaction.
Smooth orchestrators
 In FoSSaCS ’06, LNCS
, 2006
"... Abstract. A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among colocated channels. Smooth orchestrators constitute a basic mechanism that may express standard workflow patterns in Web services as well as common synchronization constructs in ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among colocated channels. Smooth orchestrators constitute a basic mechanism that may express standard workflow patterns in Web services as well as common synchronization constructs in programming languages. Smooth orchestrators may be created in one location and migrated to a different one, still not manifesting problems that usually afflict generic mobile agents. We encode an extension of Milner’s (asynchronous) pi calculus with join patterns into a calculus of smooth orchestrators and we yield a strong correctness result (full abstraction) when the subjects of the join patterns are colocated. We also study the translation of smooth orchestrators into finitestate automata, therefore addressing the implementation of colocation constraints and the case when synchronizations are not linear with respect to subjects. 1
Strong Bisimulation for the Explicit Fusion Calculus
, 2004
"... The pi calculus holds the promise of compiletime checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is wellknown that the various natural definitions of (strong) bisimulation y ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
The pi calculus holds the promise of compiletime checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is wellknown that the various natural definitions of (strong) bisimulation yield di#erent relations. In contrast, for the asynchronous pi calculus, they collapse to a single relation. We show that the definitions transfer naturally from the pi calculus to the explicit fusion calculus (a symmetric variant of the synchronous pi calculus), where they also collapse and yield a simpler theory. The important
BoPi: a distributed machine for experimenting web services technologies
 In 5th International Conference on Application of Concurrency to System Design (ACSD’05
, 2005
"... BoPi is a programming language with a runtime support that allows the distribution and the execution of programs over the network. The language is a process calculus withXML values and datatypes, and with a pattern matching mechanism for deconstructing values. The compiler gives a typesafe bytecode ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
BoPi is a programming language with a runtime support that allows the distribution and the execution of programs over the network. The language is a process calculus withXML values and datatypes, and with a pattern matching mechanism for deconstructing values. The compiler gives a typesafe bytecode in the form of anXML document, that may be deployed on the network. What comes out is a simple, statically typed, and formally defined coreBPEL language with a basic query mechanism supplied by patterns. 1
Using Bisimulation Proof Techniques for the Analysis of Distributed Abstract Machines
, 2008
"... We illustrate the use of recently developed proof techniques for weak bisimulation by analysing a generic framework for the definition of distributed abstract machines based on a messagepassing implementation. We first define this framework, and then focus on the algorithm which is used to route me ..."
Abstract
 Add to MetaCart
We illustrate the use of recently developed proof techniques for weak bisimulation by analysing a generic framework for the definition of distributed abstract machines based on a messagepassing implementation. We first define this framework, and then focus on the algorithm which is used to route messages asynchronously to their destination. A first version of this algorithm can be analysed using the standard bisimulation up to expansion proof technique. We show that in a second, optimised version, rather complex behaviours appear, for which more sophisticated techniques, relying on termination arguments, are necessary to establish behavioural equivalence.
to appear in TCS – www.wischik.com/lu/research/explicitfusions.html Explicit Fusions
"... Abstract. 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 ..."
Abstract
 Add to MetaCart
Abstract. 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. 1
Open Multiparty Interaction ⋆
"... Abstract. We present the linkcalculus, a process calculus based on interactions that are multiparty, i.e., that may involve more than two processes and are open, i.e., the number of involved processes is not fixed or known a priori. Communications are seen as chains of links, that record the source ..."
Abstract
 Add to MetaCart
Abstract. We present the linkcalculus, a process calculus based on interactions that are multiparty, i.e., that may involve more than two processes and are open, i.e., the number of involved processes is not fixed or known a priori. Communications are seen as chains of links, that record the source and the target ends of each hop of interactions. The semantics of our calculus mildly extends the one of CCS in the version without message passing, and the one of πcalculus in the full version. Cardelli and Gordon’s Mobile Ambients, whose movement interactions we show to be inherently open multiparty, is encoded in our calculus in a natural way, thus providing an illustrative example of its expressiveness.