Design and verification of long-running transactions in a timed framework

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Paolo Milazzo;Angelo Troina
Affiliations:
Dipartimento di Scienze della Cultura, Politiche e dellInformazione - Università dellInsubria, Via Carloni 78, 22100 - Como, Italy;Dipartimento di Informatica - Università di Pisa, Largo Pontecorvo 3, 56127 - Pisa, Italy;Dipartimento di Informatica - Università di Pisa, Largo Pontecorvo 3, 56127 - Pisa, Italy;Dipartimento di Informatica - Università di Torino, Corso Svizzera 185, 10149 - Torino, Italy
Venue:
Science of Computer Programming
Year:
2008

Citing 8
Cited 5

Sagas

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A theory of timed automata

Theoretical Computer Science
Formal Verification of UML Statecharts with Real-Time Extensions

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
The CORBA activity service framework for supporting extended transactions

Software—Practice & Experience - Special issue: Middleware
A Petri net-based model for web service composition

ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Modelling and verifying web service orchestration by means of the concurrency workbench

ACM SIGSOFT Software Engineering Notes
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
YAWL: yet another workflow language

Information Systems

Weak bisimulation for Probabilistic Timed Automata

Theoretical Computer Science
Algebraic approach to linking the semantics of web services

Innovations in Systems and Software Engineering
Testing the reliability of web services transactions in cooperative applications

Proceedings of the 27th Annual ACM Symposium on Applied Computing
The rely/guarantee approach to verifying concurrent BPEL programs

SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Recovery within long-running transactions

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Long-running transactions consist of tasks which may be executed sequentially and in parallel, may contain subtasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be completed, a compensation mechanism must be provided. In this paper we develop a model of Communicating Hierarchical Timed Automata suitable to describe the mentioned aspects in a framework where also time is taken into account. We develop the patterns for composing long-running transactions sequentially, in parallel or by nesting. The correct compensation of a composed long-running transaction is preserved by these composition patterns. The automaton-theoretic approach allows the verification of properties by model checking. As a case study, we model and analyse an example of e-commerce application described in terms of long-running transactions.