Skip to main content

A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2013)

Abstract

Over the past two decades, numerous verification tools have been successfully used for verifying complex concurrent systems, modelled using various formalisms. However, it is still hard to coordinate these tools since they rely on such a large number of formalisms. Having a proper syntactical mechanism to interrelate them through variability would increase the capability of effective integrated formal methods. In this paper, we propose a modular approach for defining new formalisms by reusing existing ones and adding new features and/or constraints. Our approach relies on standard XML technologies; their use provides the capability of rapidly and automatically obtaining tools for representing and validating models. It thus enables fast iterations in developing and testing complex formalisms. As a case study, we applied our modular definition approach on families of Petri nets and timed automata.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. André, É., Fribourg, L., Kühne, U., Soulat, R.: IMITATOR 2.5: A tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33–36. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. André, É., Hillah, L.-M., Hulin-Hubard, F., Kordon, F., Lembachar, Y., Linard, A., Petrucci, L.: CosyVerif: An open source extensible verification environment. In: ICECCS. IEEE Computer Society (to appear, 2013)

    Google Scholar 

  4. Baldan, P., Bruni, A., Corradini, A., König, B., Rodríguez, C., Schwoon, S.: Efficient unfolding of contextual Petri nets. Theoretical Computer Science 449, 2–22 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ballarini, P., Djafri, H., Duflot, M., Haddad, S., Pekergin, N.: HASL: An expressive language for statistical verification of stochastic models. In: VALUETOOLS, pp. 306–315 (2011)

    Google Scholar 

  6. Blom, S., van de Pol, J., Weber, M.: LTSmin: Distributed and symbolic reachability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 354–359. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Colange, M., Baarir, S., Kordon, F., Thierry-Mieg, Y.: Crocodile: A symbolic/symbolic tool for the analysis of symmetric nets with bags. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 338–347. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Ferré, S., Ridoux, O.: Logic functors: A toolbox of components for building customized and embeddable logics. Technical report, INRIA (2006), http://www.irisa.fr/LIS/ferre/logfun/doc/ResearchReportInria0000.pdf

  9. Haddad, S., Kordon, F., Petrucci, L., Pradat-Peyre, J.-F., Trèves, N.: Efficient state-based analysis by introducing bags in Petri net color domains. In: ACC 2009, pp. 5018–5025. Omnipress IEEE (2009)

    Google Scholar 

  10. Hamez, A., Hillah, L.-M., 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, pp. 273–275. IEEE Computer Society (2006)

    Google Scholar 

  11. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer 1, 110–122 (1997)

    Article  MATH  Google Scholar 

  12. Hillah, L.M., Kordon, F., Petrucci, L., Trèves, N.: PNML framework: An extendable reference implementation of the Petri net markup language. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 318–327. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Hong, S., Kordon, F., Paviot-Adet, E., Evangelista, S.: Computing a hierarchical static order for decision diagram-based representation from P/T nets. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) ToPNoC 2012. LNCS, vol. 6900, pp. 121–140. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. ISO/JTC1/SC34. ISO/IEC 19757-2:2008: Information Technology – Document Schema Definition Language (DSDL) – Part 2: Regular-grammar-based validation – RELAX NG. ISO/IEC, http://relaxng.org

  15. ISO/JTC1/SC34. ISO/IEC 19757-3:2006: Information Technology - Document Schema Definition Languages (DSDL) - Part 3: Rule-based validation - Schematron. ISO/IEC, http://schematron.com/

  16. ISO/JTC1/SC7/WG19. ISO/IEC 15909-2:2011. Systems and software engineering – High-level Petri nets – Part 2: Transfer format (2011)

    Google Scholar 

  17. Klai, K., Ochi, H.: Modular verification of inter-enterprise business processes. In: eKNOW, pp. 155–161 (2012)

    Google Scholar 

  18. Kordon, F., Linard, A., Buchs, D., Colange, M., Evangelista, S., Fronc, L., Hillah, L.-M., Lohmann, N., Paviot-Adet, E., Pommereau, F., Rohr, C., Thierry-Mieg, Y., Wimmel, H., Wolf, K.: Raw report on the model checking contest at Petri nets, 2012. Technical report, CoRR (2012)

    Google Scholar 

  19. Lakos, C., Petrucci, L.: Modular analysis of systems composed of semiautonomous subsystems. In: ACSD, pp. 185–196. IEEE Computer Society (2004)

    Google Scholar 

  20. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)

    Article  MATH  Google Scholar 

  21. Liu, Y., Sun, J., Dong, J.S.: PAT 3: An extensible architecture for building multi-domain model checkers. In: ISSRE, pp. 190–199. IEEE (2011)

    Google Scholar 

  22. Steinberg, D., Budinsky, F., Paternostro, M., Merks, E.: EMF: Eclipse Modeling Framework, 2nd edn. Eclipse Series. Addison-Wesley Professional (2008)

    Google Scholar 

  23. The CosyVerif group. CosyVerif Web page, http://www.cosyverif.org

  24. Urbas, M., Jamnik, M.: Diabelli: A heterogeneous proof system. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS(LNAI), vol. 7364, pp. 559–566. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

André, É. et al. (2013). A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. In: Groves, L., Sun, J. (eds) Formal Methods and Software Engineering. ICFEM 2013. Lecture Notes in Computer Science, vol 8144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41202-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41202-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41201-1

  • Online ISBN: 978-3-642-41202-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics