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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
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)
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)
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)
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)
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)
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)
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
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)
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)
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)
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)
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)
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
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/
ISO/JTC1/SC7/WG19. ISO/IEC 15909-2:2011. Systems and software engineering – High-level Petri nets – Part 2: Transfer format (2011)
Klai, K., Ochi, H.: Modular verification of inter-enterprise business processes. In: eKNOW, pp. 155–161 (2012)
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)
Lakos, C., Petrucci, L.: Modular analysis of systems composed of semiautonomous subsystems. In: ACSD, pp. 185–196. IEEE Computer Society (2004)
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)
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)
Steinberg, D., Budinsky, F., Paternostro, M., Merks, E.: EMF: Eclipse Modeling Framework, 2nd edn. Eclipse Series. Addison-Wesley Professional (2008)
The CosyVerif group. CosyVerif Web page, http://www.cosyverif.org
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)