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 changing 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
We introduce a process calculus that contains constructs to express and program resource negotiation...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic n...
We discuss the principles of distributed transactions, then we define an operational model which me...
Abstract. We discuss the principles of distributed transactions, then we define an operational model...
We discuss the principles of distributed transactions, then we define an operational model which mee...
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus fo...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
Abstract In these notes, we give an overview of the join calculus, its semantics, and its equational...
This paper presents a new distributed process calculus, called the M-calculus, that can be understo...
Abstract. The -calculus [6] has introduced in concurrency the concept of link mobility, namely the p...
Over the last five years, several systems have been proposed to take distribution into account in As...
This paper introduces a process calculus designed to capture the phenomenon of names which are known...
AbstractA calculus for distributed computation is studied, based upon four combinators. A central id...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
We introduce a process calculus that contains constructs to express and program resource negotiation...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic n...
We discuss the principles of distributed transactions, then we define an operational model which me...
Abstract. We discuss the principles of distributed transactions, then we define an operational model...
We discuss the principles of distributed transactions, then we define an operational model which mee...
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus fo...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
Abstract In these notes, we give an overview of the join calculus, its semantics, and its equational...
This paper presents a new distributed process calculus, called the M-calculus, that can be understo...
Abstract. The -calculus [6] has introduced in concurrency the concept of link mobility, namely the p...
Over the last five years, several systems have been proposed to take distribution into account in As...
This paper introduces a process calculus designed to capture the phenomenon of names which are known...
AbstractA calculus for distributed computation is studied, based upon four combinators. A central id...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
We introduce a process calculus that contains constructs to express and program resource negotiation...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic n...