Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata

  • Ruggero Lanotte
  • Andrea Maggiolo-Schettini
  • Paolo Milazzo
  • Angelo Troina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4037)


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.


Model Check Parallel Composition Transactional Activity Compositional Pattern Public Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alur, R., Kannan, S., Yannakakis, M.: Communicating Hierarchical State Machines. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 169–178. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Amnell, T., Behrmann, G., Bengtsson, J., D’Argenio, P.R., David, A., Fehnker, A., Hune, T., Jeannet, B., Larsen, K.G., Moeller, M.O., Pettersson, P., Weise, C., Yi, W.: Uppaal-now, next and future. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Benatallah, B., Himadi, R.: A Petri Net–Based Model for Web Service Composition. In: ADC 2003, pp. 191–200. Australian Computer Society (2003)Google Scholar
  5. 5.
    Brogi, A., Canal, C., Pimentel, E., Vallecillo, A.: Formalizing Web Services Choreographies. In: WS–FM 2004. ENTCS, vol. 105, pp. 73–94 (2004)Google Scholar
  6. 6.
    Bruni, R., Melgratti, H., Montanari, U.: Theoretical Foundations for Compensations in Flow Composition Languages. In: POPL 2005, pp. 209–220. ACM Press, New York (2005)Google Scholar
  7. 7.
    Garcia–Molina, H., Salem, K.: Sagas. In: SIGMOD 1987, pp. 249–259. ACM Press, New York (1987)Google Scholar
  8. 8.
  9. 9.
    Houston, I., Little, M.C., Robinson, I., Shrivastava, S.K., Wheater, S.M.: The CORBA Activity Service Framework for Supporting Extended Transactions. Software — Practice and Experience 33(4), 351–373 (2003)CrossRefzbMATHGoogle Scholar
  10. 10.
    Laneve, C., Zavattaro, G.: Foundations of Web Transactions. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 282–298. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Mazzara, M., Govoni, S.: A Case Study of Web Services Orchestration. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 1–16. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    WSCI Specification. Version 1.0, Available at:
  13. 13.
    Viroli, M.: Towards a Formal Foundation to Orchestration Languages. In: WS–FM 2004. ENTCS, vol. 105, pp. 51–71 (2004)Google Scholar
  14. 14.
    Yovine, S.: Kronos: A verification tool for real-time systems. International Journal on Software Tools for Technology Transfer 1, 123–133 (1997)CrossRefzbMATHGoogle Scholar
  15. 15.

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Ruggero Lanotte
    • 1
  • Andrea Maggiolo-Schettini
    • 2
  • Paolo Milazzo
    • 2
  • Angelo Troina
    • 2
  1. 1.Dip. di Scienze della Cultura, Politiche e dell’InformazioneUniversità dell’InsubriaItaly
  2. 2.Dip. di InformaticaUniversità di PisaItaly

Personalised recommendations