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

Abstract

International audienceOver 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

Teaching formal methods: Experience at UPMC and UP13 with CosyVerif

“…So far, 12 declared concrete formalisms from these two families are available, interrelated through a modular architecture of definitions, reusing common concepts, and enabling easy addition of new notations. They are syntactically supported by a two-layered XMLbased language: the Formalism Markup Language (FML, the superstructure) and the Graph Markup Language (GrML, the infrastructure) [9].…”

“…Short-term perspectives include the use of CosyVerif at a full-day tutorial associated with the Petri nets international conference in June 2014 9 .…”

“…None found the practical sessions "not interesting at all", 2 found it "not very interesting", 10 "interesting" and 3 "very interesting". 9 http://petrinets2014.cnam.fr/ that other universities or organisations can make their own bundles, fitted to their specific needs.…”