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. © IFIP International Federation for Information Processing 2006.
Cite
CITATION STYLE
Lanotte, R., Maggiolo-Schettini, A., Milazzo, P., & Troina, A. (2006). Modeling long-running transactions with communicating hierarchical timed automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4037 LNCS, pp. 108–122). Springer Verlag. https://doi.org/10.1007/11768869_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
