Filters








16,581 Hits in 3.5 sec

A Calculus for Long-Running Transactions [chapter]

Laura Bocchi, Cosimo Laneve, Gianluigi Zavattaro
2003 Lecture Notes in Computer Science  
We study long-running transactions in open componentbased distributed applications, such as Web Services platforms.  ...  We study the practice of πt-calculus, by discussing few paradigmatic examples, and its theory, by defining a semantics and providing a correct encoding of πt-calculus into asynchronous π-calculus.  ...  Acknowledgement We thank the anonymous referees for their fruitful comments and Greg Meredith and Tony Hoare for the insightful discussions about the topics treated in this paper.  ... 
doi:10.1007/978-3-540-39958-2_9 fatcat:x2k6e3zjavfqjfq7ihrsqerbhm

Modeling of Compensation in Long-Running Transactions

Rebwar Mala, Sardasht M-Raouf, Rebaz Mala, Rania Azad
2016 International Journal of Advanced Computer Science and Applications  
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.  ...  Therefore, transactions that need a long time to complete are programmed as a composition of a set of compensable transactions.  ...  Web services need a mechanism of transaction that run long-running transactions to address loosely coupled threads, instead of having traditional ACID transaction.  ... 
doi:10.14569/ijacsa.2016.070122 fatcat:zcd4q5ul7nbzhi35xjjbrpenwq

A Formal Framework for Web Services Coordination

Claudio Guidi, Roberto Lucchi, Manuel Mazzara
2007 Electronical Notes in Theoretical Computer Science  
BPEL4WS) make use of concepts as long-running transactions and compensations for coping with error handling.  ...  We enhance our past work -the Event Calculus -introducing two main novelties: i) a multicast event notification mechanism, and ii) event scope names binding.  ...  for describing long running transactions and business activities.  ... 
doi:10.1016/j.entcs.2006.10.046 fatcat:qdbtfwcdezbrxcaoktttnsml2m

Membrane Calculus: a formal method for Grid transactions

Zhengwei Qi, Minglu Li, Cheng Fu, Dongyu Shi, Jinyuan You
2006 Concurrency and Computation  
Finally, a typical long-running transaction example is presented to demonstrate the usage of Membrane Calculus.  ...  We propose a preliminary theoretical model called Membrane Calculus based on Membrane Computing and Petri Nets to formalize Grid transactions.  ...  A Long-running Transaction of Membrane Calculus In this part, we discuss the model of the long-running transaction, i.e., Flight and Hotel Booking. That is an example from the section 3.3 of [14] .  ... 
doi:10.1002/cpe.1030 fatcat:snoqtn3asje7dc7jgasmrnzlwm

Membrane Calculus: A Formal Method for Grid Transactions [chapter]

Zhengwei Qi, Cheng Fu, Dongyu Shi, Jinyuan You, Minglu Li
2004 Lecture Notes in Computer Science  
Finally, a typical long-running transaction example is presented to demonstrate the usage of Membrane Calculus.  ...  We propose a preliminary theoretical model called Membrane Calculus based on Membrane Computing and Petri Nets to formalize Grid transactions.  ...  A Long-running Transaction of Membrane Calculus In this part, we discuss the model of the long-running transaction, i.e., Flight and Hotel Booking. That is an example from the section 3.3 of [14] .  ... 
doi:10.1007/978-3-540-30208-7_16 fatcat:xgh7folx6bgt7cboom7x65juiy

Dynamic Recovering of Long Running Transactions [chapter]

Cátia Vaz, Carla Ferreira, António Ravara
2009 Lecture Notes in Computer Science  
This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism.  ...  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, with a compensation mechanism to recover from failures, named as dcπ-calculus.  ... 
doi:10.1007/978-3-642-00945-7_13 fatcat:lhhinteztvg3hjanu47mhz6uaq

On the Impact of Formal Methods in the SOA

Laura Bocchi, Paolo Ciancarini
2006 Electronical Notes in Theoretical Computer Science  
The classic notion of transaction in database systems evolved into weaker forms, in order to adapt to multi-domain, loosely coupled environments including the execution of long running activities.  ...  The former is the local perspective of the business process: transactions are a control construct providing a user-defined error handling mechanism.  ...  [12] implemented long running transactions with the Join calculus [26] .  ... 
doi:10.1016/j.entcs.2006.05.018 fatcat:6cs4luj6mre3vbxpa7gcjhuub4

On the Expressive Power of Primitives for Compensation Handling [chapter]

Ivan Lanese, Cátia Vaz, Carla Ferreira
2010 Lecture Notes in Computer Science  
., for web services) the problem is usually tackled using long running transactions and compensations: activities programmed to recover partial executions of long running transactions.  ...  Modern software systems have frequently to face unexpected events, reacting so to reach a consistent state.  ...  Tiezzi and the anonymous reviewers for useful suggestions and comments.  ... 
doi:10.1007/978-3-642-11957-6_20 fatcat:yksvdjd3kff4nnr3msyef3zbau

Abstractions for fault-tolerant global computing

Tom Chothia, Dominic Duggan
2004 Theoretical Computer Science  
As an example application, a calculus of atomic failures is presented, the atf-calculus, and its encoding in the lqp(dc)-calculus used to verify a correctness property.  ...  The calculi incorporate various abstractions for fault tolerance, from which several forms of distributed transactions and optimistic computation may be built.  ...  Acknowledgements Thanks to Cedric Fournet, Andrew Gordon and Sanjiva Prasad for helpful conversations. Thanks to the anonymous reviewers for their excellent comments and suggestions.  ... 
doi:10.1016/j.tcs.2003.09.014 fatcat:mhgvwkimj5dnvceejyb4wl4oti

A Process Calculus Analysis of Compensations [chapter]

Luís Caires, Carla Ferreira, Hugo Vieira
2009 Lecture Notes in Computer Science  
Conversations in service-oriented computation are frequently long running.  ...  In this paper, we investigate the representation and analysis of structured compensating transactions within a process calculus model, by embedding in the Conversation Calculus certain structured compensation  ...  Although well known in the context of transaction processing systems for quite a long time (see e.g., [9] ), the use of compensation as a mechanism to undo the effect of long running transactions, and  ... 
doi:10.1007/978-3-642-00945-7_6 fatcat:7u24nhrkibbfnfq7r52regmvdu

Compositional Nested Long Running Transactions [chapter]

Laura Bocchi
2004 Lecture Notes in Computer Science  
Existing research has already studied long running transactions within a formal context.  ...  Web Services offer a widespread standard for making services available on the Internet.  ...  I thank Paolo Ciancarini, Cosimo Laneve, Gianluigi Zavattaro and the anonymous referees for their useful comments.  ... 
doi:10.1007/978-3-540-24721-0_14 fatcat:dluko3x2brbw3k5pjnlnxdsh7q

A Framework for Generic Error Handling in Business Processes

Manuel Mazzara, Roberto Lucchi
2004 Electronical Notes in Theoretical Computer Science  
Notably, the proposed framework is expressive enough to compare different solutions for managing long running transactions such as BPEL4WS and StAC.  ...  Several proposals for describing Choreography for Business Processes have been presented in the last years and many of these languages make use of concepts as longrunning transactions and compensations  ...  Most of the Choreography languages listed at the beginning use long running transactions and compensations as a mechanism for describing loosely-coupled activities.  ... 
doi:10.1016/j.entcs.2004.05.002 fatcat:7kuuwg2uefbs3gqwtxpikizium

Decidability Results for Dynamic Installation of Compensation Handlers [chapter]

Ivan Lanese, Gianluigi Zavattaro
2013 Lecture Notes in Computer Science  
In this paper we show that in a simple π-like calculus with static compensations the termination of a process is decidable, but it is undecidable in one with dynamic compensations.  ...  Dynamic compensation installation allows for easier specification of fault handling in complex interactive systems since it enables to update the compensation policies according to run-time information  ...  In the setting of service-oriented computing, long running transactions have been put forward to solve this problem. A long running transaction is a computation that either succeeds, or it aborts.  ... 
doi:10.1007/978-3-642-38493-6_10 fatcat:rfaurc2645fk3k76bt7bdbpsym

On the analysis of compensation correctness

Cátia Vaz, Carla Ferreira
2012 The Journal of Logic and Algebraic Programming  
In this paper, we use a process calculus suitable for modelling long running transactions with a recovery mechanism based on compensations.  ...  Due to the long running nature of service interactions, a main challenge in service composition is ensuring correctness of transaction recovery.  ...  Acknowledgements We thank to Michael Leuschel, Jens Bendisposto and Daniel Plagge for their support on the ProB tool.  ... 
doi:10.1016/j.jlap.2012.04.002 fatcat:btejurrj2ffoddgogaxyivfgqe

A compositional theory for STM Haskell

Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon
2009 Proceedings of the 2nd ACM SIGPLAN symposium on Haskell - Haskell '09  
As a motivating example, we consider Haskell code for a concurrent non-deterministic tree rewriting algorithm implementing the operational semantics of the ambient calculus.  ...  The core of our theory is a uniform model, in the spirit of process calculi, of the run-time state of multi-threaded STM Haskell programs.  ...  A. Source code This appendix contains the remainder of the source code for the ambient API of Section 3.  ... 
doi:10.1145/1596638.1596648 dblp:conf/haskell/BorgstromBG09 fatcat:ymlpojn6b5dedegpvvn4lpy2i4
« Previous Showing results 1 — 15 out of 16,581 results