Modeling long–running transactions with communicating hierarchical timed automata

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Paolo Milazzo;Angelo Troina
Affiliations:
Dip. di Scienze della Cultura, Politiche e dell'Informazione, Università dell'Insubria;Dip. di Informatica, Università di Pisa;Dip. di Informatica, Università di Pisa;Dip. di Informatica, Università di Pisa
Venue:
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Year:
2006

Citing 11
Cited 4

Sagas

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

Theoretical Computer Science
Communicating Hierarchical State Machines

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
UPPAAL: now, next, and future

Modeling and verification of parallel processes
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
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a Formal Foundation to Orchestration Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Formalizing Web Service Choreographies

Electronic Notes in Theoretical Computer Science (ENTCS)
Foundations of web transactions

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A case study of web services orchestration

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages

Security in a Model for Long-running Transactions

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Failure-divergence semantics and refinement of long running transactions

Theoretical Computer Science
Security in a Model for Long-running Transactions

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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 sub-tasks, 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 Hierarchical Timed Automata suitable to describe the aspects mentioned. The automaton-theoretic approach allows the verification of properties by model checking. As a case study, we model and analyze an example of long–running transaction.