Advertisement

Modelling and Formal Verification of the NEO Protocol

  • Christine Choppy
  • Anna Dedova
  • Sami Evangelista
  • Kaïs Klaï
  • Laure Petrucci
  • Samir Youcef
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7400)

Abstract

In order to manage very large distributed databases such as those used for banking and e-government applications, and thus to handle sensitive data, an original peer-to-peer transaction protocol, called NEO, was proposed. To ensure its effective operation, it is necessary to check a set of critical properties. The most important ones are related to availability of data that must be guaranteed by the system. Thus, our objective aims at verifying critical properties of the NEO protocol so as to guarantee such properties are satisfied. The model is obtained by reverse-engineering from the source code and then formal verification is performed. We focus in this article on the two phases of the NEO protocol occurring at the initialisation of the system. The first one, the election phase, aims at designating a special node that will pilot the overall system. The bootstrap protocol, triggered at the end of the election, ensures that the system will enter its operational state in a coherent way. Therefore, the correctness of these two phases is mandatory for the reliability of the system.

Keywords

Master Node Storage Node Reachability Graph Partial Order Reduction Election Phase 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The Coloane tool Homepage, https://coloane.lip6.fr/
  2. 2.
    The GreatSPN tool Homepage, http://www.di.unito.it/~greatspn
  3. 3.
  4. 4.
    Bertrand, O., Calonne, A., Choppy, C., Hong, S., Klai, K., Kordon, F., Okuji, Y., Paviot-Adet, E., Petrucci, L., Smets, J.-P.: Verification of Large-Scale Distributed Database Systems in the NEOPPOD Project. In: PNSE 2009, pp. 315–317 (2009)Google Scholar
  5. 5.
    Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A Symbolic Reachability Graph for Coloured Petri Nets. TCS 176(1-2), 39–65 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Choppy, C., Dedova, A., Evangelista, S., Hong, S., Klai, K., Petrucci, L.: The NEO Protocol for Large-Scale Distributed Database Systems: Modelling and Initial Verification. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 145–164. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Clarke, E.M., Grumberg, O., Minea, M., Peled, D.: State Space Reduction Using Partial Order Techniques. STTT 2(3), 279–287 (1999)zbMATHCrossRefGoogle Scholar
  8. 8.
    ERP5. Central Bank Implements Open Source ERP5 in Eight Countries after Proprietary System Failed, http://www.erp5.com/news-central.bank
  9. 9.
    Evangelista, S.: High Level Petri Nets Analysis with Helena. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 455–464. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Haddad, S., Pradat-Peyre, J.-F.: New Efficient Petri Nets Reductions for Parallel Programs Verification. Parallel Processing Letters 1, 16 (2006)Google Scholar
  11. 11.
    Hamez, A., Hillah, L., Kordon, F., Linard, A., Paviot-Adet, E., Renault, X., Thierry-Mieg, Y.: New Features in CPN-AMI 3: Focusing on the Analysis of Complex Distributed Systems. In: ACSD 2006, pp. 273–275. IEEE Computer Society (2006), http://move.lip6.fr/software/CPNAMI/
  12. 12.
    Huber, P., Jensen, K., Shapiro, R.M.: Hierarchies in Coloured Petri Nets. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 313–341. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  13. 13.
    Jensen, K., Kristensen, L.M.: Coloured Petri Nets, Modelling and Validation of Concurrent Systems. Springer Verlag Monograph (2009)Google Scholar
  14. 14.
    Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems. STTT 9(3-4), 213–254 (2007)CrossRefGoogle Scholar
  15. 15.
    Kordon, F., Linard, A., Paviot-Adet, E.: Optimized Colored Nets Unfolding. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 339–355. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    University of Hamburg. The Petri Nets Tool Database, http://www.informatik.uni-hamburg.de/TGI/PetriNets/tools/db.html
  17. 17.
    Varpaaniemi, K., Heljanko, K., Lilius, J.: Prod 3.2: An Advanced Tool for Efficient Reachability Analysis. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 472–475. Springer, Heidelberg (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christine Choppy
    • 1
  • Anna Dedova
    • 1
  • Sami Evangelista
    • 1
  • Kaïs Klaï
    • 1
  • Laure Petrucci
    • 1
  • Samir Youcef
    • 1
  1. 1.LIPN, CNRS, UMR 7030Université Paris 13, Sorbonne Paris CitéVilletaneuseFrance

Personalised recommendations