Towards the Formal Verification of Data-Intensive Applications Through Metric Temporal Logic

  • Francesco Marconi
  • Marcello M. BersaniEmail author
  • Madalina Erascu
  • Matteo Rossi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10009)


We present an approach for the automated formal verification of distributed systems based on the Storm technology. The approach is based on a formal model of the behavior of Storm topologies given in terms of the CLTLoc metric temporal logic extended with counters. We present a tool-supported mechanism to automatically generate formal models from high-level description of Storm topologies. The Zot formal verification tool is then used to check whether some desired properties hold for the modeled system or not. The analyzed properties concern the growth of the queues of the nodes of the Storm topology. Some experiments performed on example topologies show how the timing features of the modeled system influence the behavior of the queues of the nodes.


Data-intensive applications Distributed systems Formal verification Storm technology Metric temporal logic 



Work supported by Horizon 2020 project no. 644869 (DICE).


  1. 1.
  2. 2.
    The Zot bounded satisfiability checker.
  3. 3.
    Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of LICS, pp. 160–170 (1993)Google Scholar
  4. 4.
    Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the expressiveness of timed automata and time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 211–225. Springer, Heidelberg (2005). doi: 10.1007/11603009_17 CrossRefGoogle Scholar
  5. 5.
    Bersani, M., Erascu, M., Marconi, F., Rossi, M.: DICE verification tool - initial version. Technical report, DICE Consortium (2016).
  6. 6.
    Bersani, M.M., Frigeri, A., Morzenti, A., Pradella, M., Rossi, M., Pietro, P.S.: Constraint LTL satisfiability checking without automata. J. Appl. Log. 12(4), 522–557 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Bersani, M.M., Rossi, M., San Pietro, P.: A tool for deciding the satisfiability of continuous-time metric temporal logic. Acta Informatica 53(2), 171–206 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Bouajjani, A., Mayr, R.: Model checking lossy vector addition systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 323–333. Springer, Heidelberg (1999). doi: 10.1007/3-540-49116-3_30 CrossRefGoogle Scholar
  9. 9.
    Casale, G., Ardagna, D., Artac, M., Barbier, F., Nitto, E.D., Henry, A., Iuhasz, G., Joubert, C., Merseguer, J., Munteanu, V.I., Perez, J., Petcu, D., Rossi, M., Sheridan, C., Spais, I., Vladušič, D.: DICE: quality-driven development of data-intensive cloud applications. In: Proceedings of MiSE, pp. 78–83 (2015)Google Scholar
  10. 10.
    Demri, S., D’Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3), 380–415 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. Technical report LSV-06-5, LSV (2006)Google Scholar
  12. 12.
    Finkel, A.: Decidability of the termination problem for completely specified protocols. Distrib. Comput. 7(3), 129–135 (1994)CrossRefGoogle Scholar
  13. 13.
    Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling Time in Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2012)CrossRefzbMATHGoogle Scholar
  14. 14.
    Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Reutenauer, C.: The Mathematics of Petri Nets. Masson and Prentice, Paris (1990)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Francesco Marconi
    • 1
  • Marcello M. Bersani
    • 1
    Email author
  • Madalina Erascu
    • 2
  • Matteo Rossi
    • 1
  1. 1.DEIBPolitecnico di MilanoMilanItaly
  2. 2.Institute e-Austria Timisoara and West University of TimisoaraTimisoaraRomania

Personalised recommendations