On the interplay between fault handling and request-response service invocations

Guidi, Claudio; Lanese, Ivan; Montesi, Fabrizio; Zavattaro, Gianluigi

doi:10.1109/acsd.2008.4574611

Cited by 27 publications

(39 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Guidi et al [10] propose an extension of SOCK [24], which is inspired by WSDL and BPEL. This calculus includes explicit primitives for dynamic handler installation, such as fault and compensation handlers and automatic failure notification.…”

Section: Related Workmentioning

confidence: 99%

“…Such approaches either rely on, and try to model closely, existing standards and technologies [8][9][10], or are language and technology independent, focusing on the main concepts associated to LRTs [11][12][13][14][15]. However, in most of these works the compensation mechanism is static, and moreover, their settings do not provide an important property: the guarantee of installation and of activation of a compensation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Recovering of Long Running Transactions

Vaz

Ferreira

Ravara

2009

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Dynamic Recovering of Long Running Transactions

Vaz

Ferreira

Ravara

2009

Trustworthy Global Computing

View full text Add to dashboard Cite

show abstract

“…The Jolie approach allows for programming safer applications, including distributed compensation of faults. The fact that the request-response pattern is not disrupted by errors has been formalized and proved in [59], by relying on SOCK [60], a calculus defining the formal semantics of Jolie, including its error handling features [58]. However, a nasty side effect of the Jolie approach is that the client has to wait for answers of request-response invocations before proceeding in its execution.…”

Section: Chapter 10mentioning

confidence: 99%

Constraints meet concurrency

Mauro

2015

Constraints

View full text Add to dashboard Cite

We investigate the benefits that emerge when the fields of constraint programming and concurrency meet. On one hand, constraints can be use in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. On the other hand, problems modeled by using constraints can be solved faster and more efficiently using a concurrent system. We explore both directions providing two separate lines of contribution. Firstly we study the expressive power of a concurrent language, namely Constraint Handling Rules, that supports constraints as a primitive construct. We show what features of this language make it Turing powerful. Then we propose a framework to solve constraint problems that is intended to be deployed on a concurrent system. For the development of this framework we used the concurrent language Jolie following the Service Oriented paradigm. Based on this experience, we also propose an extension to Service Oriented Languages to overcome some of their limitations and to improve the development of concurrent applications. Needless to say, I am also in debt with my coauthors:

show abstract

“…An extension of SOCK [33] expanded by GuiDi et al [32], which inspired by WSDL and BPEL. The clear primitives for dynamic handler installation included in this calculus, for example, error and compensation handlers and automatic failure announcement.…”

Section: Litreture Reviewmentioning

confidence: 99%

Modeling of Compensation in Long-Running Transactions

Nabi¹,

Mahmood²,

Nabi³

et al. 2016

ijacsa

View full text Add to dashboard Cite

Abstract-nowadays, the most controversial issue is transaction in database systems or web services. Specifically, in the area of service-oriented computing, where business transactions always need long periods of time to finish. In the case of a failure rollback, which is the traditional method, it will not be enough and not suitable for handling errors during long running transactions. As a substitute, the most appropriate approach is compensation which is used as an error recovery mechanism. Therefore, transactions that need a long time to complete are programmed as a composition of a set of compensable transactions. This study attempts to design several compensation policies in the long running web transaction especially when the transaction has parallel threads. Meabwhile, one thread in sequence steps of the transaction may fail. This paper also describes and models many different ways to compensate to the thread. Moreover, this study proposes a system to implement creating long running transactions as well as simulating failures by using compensation policies.

show abstract

On the interplay between fault handling and request-response service invocations

Cited by 27 publications

References 19 publications

Dynamic Recovering of Long Running Transactions

Dynamic Recovering of Long Running Transactions

Constraints meet concurrency

Modeling of Compensation in Long-Running Transactions

Contact Info

Product

Resources

About