Abstract. We discuss the principles of distributed transactions, then we define an operational model which meets the basic requirements and we give a prototyping implementation for it in join-calculus. Our model: (1) extends BizTalk with multiway transactions; (2) exploits an original algorithm, for distributed commit; (3) can deal with dynamically chang-ing communication topology; (4) is almost language-independent. In fact, the model is based on a two-level classification of resources, which should be easily conveyed to distributed calculi and languages, providing them with a uniform transactional mechanism.
This paper presents a new distributed process calculus, called the M-calculus, that can be understoo...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
Abstract. The -calculus [6] has introduced in concurrency the concept of link mobility, namely the p...
We discuss the principles of distributed transactions, then we define an operational model which mee...
We discuss the principles of distributed transactions, then we define an operational model which me...
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus fo...
Abstract In these notes, we give an overview of the join calculus, its semantics, and its equational...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
In global computing applications the availability of a mechanism for some form of committed choice c...
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic n...
Over the last five years, several systems have been proposed to take distribution into account in As...
In global computing applications the availability of a mechanism for some form of committed choice c...
This paper proposes a formal approach to the design and programming of Long Running Transactions (LR...
Abstract In global computing applications the availability of a mechanism for some formof committed ...
This paper proposes a formal approach to the design and programming of long running transactions (LR...
This paper presents a new distributed process calculus, called the M-calculus, that can be understoo...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
Abstract. The -calculus [6] has introduced in concurrency the concept of link mobility, namely the p...
We discuss the principles of distributed transactions, then we define an operational model which mee...
We discuss the principles of distributed transactions, then we define an operational model which me...
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus fo...
Abstract In these notes, we give an overview of the join calculus, its semantics, and its equational...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
In global computing applications the availability of a mechanism for some form of committed choice c...
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic n...
Over the last five years, several systems have been proposed to take distribution into account in As...
In global computing applications the availability of a mechanism for some form of committed choice c...
This paper proposes a formal approach to the design and programming of Long Running Transactions (LR...
Abstract In global computing applications the availability of a mechanism for some formof committed ...
This paper proposes a formal approach to the design and programming of long running transactions (LR...
This paper presents a new distributed process calculus, called the M-calculus, that can be understoo...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
Abstract. The -calculus [6] has introduced in concurrency the concept of link mobility, namely the p...