Nested Commits For Mobile Calculi: Extending Join

Bruni, Roberto; Melgratti, Hernán; Montanari, Ugo

doi:10.1007/1-4020-8141-3_43

Cited by 36 publications

(55 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rule (os-s) models a step due to transitions of the system that do not involve the observer. The interactions of the system with nondeterministic observers are defined by rule (os-sum); notice that, by (os-tick), if O = , the other branch O is discarded 6 . Rule (os-cong) is the usual rule for congruence.…”

Section: Observed Systemsmentioning

confidence: 99%

See 1 more Smart Citation

A Java Inspired Semantics for Transactions in SOC

Bocchi

Tuosto

2010

Trustworthly Global Computing

View full text Add to dashboard Cite

Abstract. We propose a formal semantics for distributed transactions inspired by the attribute mechanisms of the Java Transaction API. Technically, we model services in a process calculus featuring transactional scope mechanisms borrowed from the so called container-managed transactions of Java. We equip our calculus with a type system for our calculus and show that, in well-typed systems, it guarantees absence of run-time errors due to misuse of transactional mechanisms.

show abstract

Section: Observed Systemsmentioning

confidence: 99%

“…StAC [8] and CJoin [6] are process calculi which model arbitrarily nested transactions and focus on the separation of process management with error/compensation. The latter offers a mechanism to merge different scopes but it is not offering the flexibility of the transactional attributes of ATc.…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

A Java Inspired Semantics for Transactions in SOC

Bocchi

Tuosto

2010

Trustworthly Global Computing

View full text Add to dashboard Cite

show abstract

“…It is finally worth to mention Ugo's work on transactional extensions of concurrent frameworks [44,20,12,13,7].…”

Section: Ugo Montanari's Models Of Computationmentioning

confidence: 99%

Models of Computation: A Tribute to Ugo Montanari’s Vision

Bruni

Sassone

2008

Concurrency, Graphs and Models

Self Cite

View full text Add to dashboard Cite

Ugo's research activity in the area of Models of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo's trademark is that undefinable ability to understand and distill computational aspects into new models as if you were reading them out of some evident connection between well-know models: only, most often, that connection is really visible only after Ugo shows the way. Like experienced sailors have trusted compasses and sextants to help them find the best routes to harbour, Ugo relies on a bag of favourite tools which he has used along the years to deliver a variety of contributions to the MoC area. To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms.In this introductory contribution we would like to recall some of the influential MoC models put forward by Ugo which cut across the three approaches. Before doing that, it is worth devoting some space to discuss the three aspects separately. Notably, the use of category theory is a pervasive common trait.Algebraic techniques. By algebraic techniques we refer broadly to the use of universal algebras and initial model semantics; of universal coalgebras and final semantics; and of bialgebras. Many interesting papers witness Ugo's leading role in exploiting algebraic techniques during his entire scientific career. Indeed, his contributions are too many to mention all in the space allocated to this overview; we shall therefore attempt to convey the sense of Ugo's broad-spectrum contribution by recapping only a few key results.Reference [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented several key insights in software specification and development for the first time, like the separation between given sorts and newly specified ones, whereby the given sorts lay the ground to define the observable behaviour for the new sorts. Another key suggestion is that the specification of new data types is often partial -in the sense that it may include "don't care" cases-and that many realisations can exist that exhibit equivalent observable behaviour but are not isomorphic. In fact, [43] shows that the isomorphism classes of observably equivalent algebras conforming to the partial specification form a complete lattice, yielding a so-called loose semantics.Possibly the best known of Ugo's papers, [52] exposes the underlying monoidal structure of the category of Petri net computations. The title itself is revealing: Petri nets are monoids. Besides doing what it says on the tin, this paper opened a long-lasting and fruitful collaboration with José Meseguer, and a research line on the initial semantics of P. Degano et al. (Eds.): Montanari

show abstract

“…Several proposals have recently appeared in the literature focused on the formalisation of compensable processes using process calculi. They can be roughly divided into two types: (i) compensable flow composition [6,5,7] closer to the spirit of orchestration languages like BPEL4WS, where suitable process algebras are designed from the scratch to describe the possible flow of control among services; and (ii) interaction based compensations [1,4,9,11], as suitable extensions of well-known name passing calculi, like the π-calculus and join-calculus, for describing transactional choreographies, where each service describes its possible interactions, and the actual composition takes place dynamically, i.e. when services interact.…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, we note that the semantics of original cCSP corresponds to policy (3), while the two original semantics of Sagas Calculi, called Naïve and Revised, follow respectively policies (2) and (4). Finally, we compare the four alternatives (and hence the original semantics of both proposals) by relating the set of traces that each policy associates to a process.…”

Section: Introductionmentioning

confidence: 99%

Comparing Two Approaches to Compensable Flow Composition

Bruni

Butler²,

Ferreira

et al. 2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Web services composition is an emerging paradigm for the integration of long running business processes, attracting the interest of both Industry, in terms of XML-based standards for business description, and Academy, exploiting process description languages. The key challenging aspects to model are orchestration workflows, choreography of exchanged messages, fault handling, and transactional integrity with compensation mechanisms. Few recent proposals attempted to mitigate the explosion of XML-constructs in ad hoc standards by a careful selection of a small set of primitives related to the above aspects. This papers clarifies analogies and differences between two such recent process description languages: one based on interleaving trace semantics and the other on concurrent traces. We take advantage of their comparison to characterise and relate four different coordination policies for compensating parallel processes. Such policies differ on the way in which the abort of a process influences the execution of sibling processes, and whether compensation is distributed or centralised.

show abstract

Nested Commits For Mobile Calculi: Extending Join

Cited by 36 publications

References 10 publications

A Java Inspired Semantics for Transactions in SOC

A Java Inspired Semantics for Transactions in SOC

Models of Computation: A Tribute to Ugo Montanari’s Vision

Comparing Two Approaches to Compensable Flow Composition

Contact Info

Product

Resources

About