Results 1  10
of
25
Orchestrating Transactions in Join Calculus
, 2002
"... 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. In particular, our model: (1) extends BizTalk's short transactions; (2) it exploits an original commit alg ..."
Abstract

Cited by 34 (12 self)
 Add to MetaCart
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. In particular, our model: (1) extends BizTalk's short transactions; (2) it exploits an original commit algorithm, which is distributed; (3) it can deal with dynamically changing communication topology; (4) it is almost languageindependent. In fact, the model is simply based on a twolevel classification of resources, which should be easily conveyed to distributed calculi and languages, providing them with a powerful transactional mechanism.
Bigraphical Reactive Systems: Basic Theory
 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF MATHEMATICIANS
, 2001
"... A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the calculus and the ambient calculus. Bigraphs are shown to be a special case of a more abstract notion, wide reactive systems (WRSs), not assuming any particular graphical or other structure but equipped with a notion of width, which expresses that agents, contexts and reactions may all be widely distributed entities. A behavioural theory is established for WRSs using the categorical notion of relative pushout; it allows labelled transition systems to be derived uniformly, in such a way that familiar behavioural preorders and equivalences, in particular bisimilarity, are congruential under certain conditions. Then the theory of bigraphs is developed, and they are shown to meet these conditions. It is shown that, using certain functors, other WRSs which meet the conditions may also be derived; these may, for example, be forms of BRS with additional structure. Simple examples of bigraphical systems are discussed; the theory is developed in a number of ways in preparation for deeper application studies.
The Java memory model: Operationally, denotationally, axiomatically
 IN: 16TH ESOP
, 2007
"... A semantics to a small fragment of Java capturing the new memory model (JMM) described in the Language Specification is given by combining operational, denotational and axiomatic techniques in a novel semantic framework. The operational steps (specified in the form of SOS) construct denotational m ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
A semantics to a small fragment of Java capturing the new memory model (JMM) described in the Language Specification is given by combining operational, denotational and axiomatic techniques in a novel semantic framework. The operational steps (specified in the form of SOS) construct denotational models (configuration structures) and are constrained by the axioms of a configuration theory. The semantics is proven correct with respect to the Language Specification and shown to capture many common examples in the JMM literature.
Higher dimensional transition systems
, 1996
"... We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, settheoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimension ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, settheoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to nondegenerate automata. Moreovel; we prove that the natural notion of bisimulation for such structures is a generalisation of the strong history preserving bisimulation, and provide an abstract categorical account of it via open maps. Finally, we dejine a notion of unfolding for higher dimensional transition systems and characterise the structures so obtained as a generalisation of event structures.
Full completeness of the multiplicative linear logic of chu spaces
 Proc. IEEE Logic in Computer Science 14
, 1999
"... We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cutfree proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding operations on the category of Chu spaces on ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cutfree proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding operations on the category of Chu spaces on a twoletter alphabet. This is the online version of the paper of the same title appearing in the LICS’99 proceedings. 1
ZeroSafe Nets, or Transition Synchronization Made Simple
 PROC. OF EXPRESS’97
, 1997
"... In addition to ordinary places, called stable, zerosafe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable transaction, which may use zero places, but which is atomic w ..."
Abstract

Cited by 17 (13 self)
 Add to MetaCart
In addition to ordinary places, called stable, zerosafe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable transaction, which may use zero places, but which is atomic when seen from stable places: no stable token generated in a transaction can be reused in the same transaction. Every zerosafe net has an ordinary PlaceTransition net as its abstract counterpart, where only stable places are maintained, and where every transaction becomes a transition. The two nets allow us to look at the same system from both an abstract and a refined viewpoint. To achieve this result no new interaction mechanism is used, besides the ordinary tokenpushing rules of nets. The refined zerosafe nets can be much smaller than their corresponding abstract P/T nets, since they take advantage of a transition synchronization mechanism. For instance, when transactions of unlimited l...
Higher Dimensional Automata Revisited
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2000
"... ..."
Transactions and ZeroSafe Nets
 Advances in Petri Nets: Unifying Petri Nets, Lect. Notes in Comput. Sci. 2128
, 2001
"... When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling of transac ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling of transactions based on zerosafe nets. They extend ordinary pt nets with a simple mechanism for transition synchronization. We show that the net theory developed under the two most diffused semantic interpretations (collective token and individual token philosophies) can be uniformly adapted to zerosafe nets. In particular, we show that each zerosafe net has associated two pt nets which represent the abstract counterparts of the modeled system according to the two philosophies. We show several applications of the framework, a distributed interpreter for zs nets based on classical net unfolding (here extended with a commit rule) and discuss some extensions to other net flavours.
ZeroSafe Nets: The Individual Token Approach
 Proceedings WADT'97, 12th workshop on Recent Trends in Algebraic Development Techniques, volume 1376 of Lect. Notes in Comput. Sci
, 1998
"... In this paper we provide both an operational and an abstract concurrent semantics for zerosafe nets under the individual token philosophy. The main feature of zerosafe nets is a primitive notion of transition synchronization. Besides ordinary places, called stable places, zerosafe nets come equip ..."
Abstract

Cited by 13 (13 self)
 Add to MetaCart
In this paper we provide both an operational and an abstract concurrent semantics for zerosafe nets under the individual token philosophy. The main feature of zerosafe nets is a primitive notion of transition synchronization. Besides ordinary places, called stable places, zerosafe nets come equipped with zero places, which are empty in any stable marking. Connected transactions represent basic atomic computations of the system between stable markings. They must satisfy two main requirements: 1) to model interacting activities which cannot be decomposed into disjoint subactivities, and 2) not to consume stable tokens which were generated in the same transaction. Zero tokens acts as triggers for the firings of the transitions which compose the transaction. The abstract counterpart of a zerosafe net consists of a P/T net where each transition locates a distinguished transaction. In the second part of the paper, following the Petri nets are monoids approach, we make use of catego...
Functorial Semantics for Petri Nets under the Individual Token Philosophy
, 1999
"... Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory because it lac ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory because it lacks universality and also functoriality. We introduce the notion of prenet to recover these aspects, obtaining a fully satisfactory categorical treatment centered on the notion of adjunction. This allows us to present a purely logical description of net behaviours under the individual token philosophy in terms of theories and theory morphisms in partial membership equational logic, yielding a complete match with the theory developed by the authors for the collective token view of nets.