Results 1  10
of
16
Orchestrating transactions in join calculus
 CONCUR, volume 2421 of LNCS
, 2002
"... 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 joincalculus. Our model: (1) extends BizTalk with multiway transactions; (2) exploits an original algorithm, for ..."
Abstract

Cited by 38 (12 self)
 Add to MetaCart
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 joincalculus. 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 languageindependent. In fact, the model is based on a twolevel classification of resources, which should be easily conveyed to distributed calculi and languages, providing them with a uniform transactional mechanism. 1
Modelling Mobility with Petri Hypernets
 PROCEEDINGS OF WADT 2004
, 2004
"... Petri hypernets, a novel framework for modeling mobile agents based on netswithinnets paradigm is presented. Hypernets employ a local and finitary character of interactions between agents, and provide means for a modular and hierarchical description. They are capable of modelling mobile agents tfr ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
Petri hypernets, a novel framework for modeling mobile agents based on netswithinnets paradigm is presented. Hypernets employ a local and finitary character of interactions between agents, and provide means for a modular and hierarchical description. They are capable of modelling mobile agents tfrahat can dynamically change their hierarchy, and can communicate with each other and with the outside world by exchanging messages, i.e., other mobile agents.
On the Algebraic Structure of Petri Nets
 Bulletin of EATCS
, 2000
"... This paper retraces, collects, and summarises the contributions of the author — both individually and in collaboration with others — on the theme of algebraic, compositional approaches to the semantics of Petri nets. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
This paper retraces, collects, and summarises the contributions of the author — both individually and in collaboration with others — on the theme of algebraic, compositional approaches to the semantics of Petri nets.
Zerosafe net models for transactions in linda
 Proc. of ConCoord 2001
, 2001
"... Zerosafe nets are a variation of Petri nets, where transactions can be suitably modeled. The idea is to distinguish between stable places (whose markings define observable states) and zerosafe places (where tokens can only be temporarily allocated, defining hidden states): Transactions must start ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Zerosafe nets are a variation of Petri nets, where transactions can be suitably modeled. The idea is to distinguish between stable places (whose markings define observable states) and zerosafe places (where tokens can only be temporarily allocated, defining hidden states): Transactions must start and end in observable states. We propose an extension of the coordination language Linda, called TraLinda, where a few basic primitives for expressing transactions are introduced by means of different typing of tuples. By exploiting previous results of Busi, Gorrieri and Zavattaro on the net modeling of Lindalike languages, we define a concurrent operational semantics based on zerosafe nets for TraLinda, where the typing of tuples reflects evidently on the distinction between stable and zerosafe places.
Flat Committed Join in Join
, 2003
"... Committed Join (cJoin) is an extension of Join with highlevel primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e. processes without subnegotiations) can be encoded in the ordinary Join calculus by exploiting a distribu ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Committed Join (cJoin) is an extension of Join with highlevel primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e. processes without subnegotiations) can be encoded in the ordinary Join calculus by exploiting a distributed twophase commit protocol. In particular, we first define a type system that singles out flat processes and prove subject reduction for it. Then, we show that all flat cJoin processes can be written in an equivalent canonical form, where a few elementary definition patterns are used. Finally, we show that canonical flat processes can be implemented in Join. It is worth noting that negotiation primitives are encoded as fully distributed agreements between all participants, thus avoiding a centralized coordinator.
Concurrent Construction of ProofNets
, 2003
"... The functional paradigm of computation has been widely investigated and given a solid mathematical foundation, initiated with the CurryHoward isomorphism, then elaborated and extended in multiple ways. However, this paradigm is inadequate to capture many useful programming intuitions, arising in pa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The functional paradigm of computation has been widely investigated and given a solid mathematical foundation, initiated with the CurryHoward isomorphism, then elaborated and extended in multiple ways. However, this paradigm is inadequate to capture many useful programming intuitions, arising in particular in the development of applications integrating distributed, autonomous components. Indeed, in this context, nondeterminism and true concurrency are the rule, whereas functional programming stresses determinism, and, although it allows some degree of concurrency, it is more as a "nice feature to have" rather than a primary assumption. This paper is part of a program the ambition of which is to provide a logical foundation to a set of programming intuitions which, until now, have not been adequately accounted for. In particular, we are interested in the intuitions which lie behind the concept of transaction, a powerful and essential concept in distributed componentbased application development. This concept is independent of the application domain and usually captured in an abstract form in middleware architectural layers. We claim here that proofconstruction, and more precisely proofnet construction in Linear Logic, offers the adequate basis for our purpose. We outline the relation, which is of the same nature as the CurryHoward isomorphism, between transactional concepts and mechanisms on one hand, and proofnet construction on the other. Finally, we describe an algorithm which performs concurrent proofnet construction, where each expansion step is viewed as a transaction. Conflicts between such transactions are minimised using general topological properties of proofnets, based on a variant of the notion of "domination tree", introduced and proved here.
Towards a Notion of Transaction in Graph Rewriting
, 2006
"... We define transactional graph transformation systems (tgtss), a mild extension of the ordinary framework for the doublepushout approach to graph transformation, which allows to model transactional activities. Generalising the work on zerosafe nets, the new graphical formalism is based on a typing ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We define transactional graph transformation systems (tgtss), a mild extension of the ordinary framework for the doublepushout approach to graph transformation, which allows to model transactional activities. Generalising the work on zerosafe nets, the new graphical formalism is based on a typing discipline which induces a distinction between stable and unstable items. A transaction is then a suitably defined minimal computation which starts and ends in stable states. After providing the basics of tgtss, we illustrate the expected results, needed to bring the theory to full maturity, and some possible future developments.
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance
Creative Commons Attribution License. Dependencies and Simultaneity in Membrane Systems
, 2009
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.