Presentation of the 9th Edition of the Model Checking Contest

Abstract

The Model Checking Contest (MCC) is an annual competition of software tools for model checking. Tools must process an increasing benchmark gathered from the whole community and may participate in various examinations: state space generation, computation of global properties, computation of some upper bounds in the model, evaluation of reachability formulas, evaluation of CTL formulas, and evaluation of LTL formulas.For each examination and each model instance, participating tools are provided with up to 3600 s and 16 gigabyte of memory. Then, tool answers are analyzed and confronted to the results produced by other competing tools to detect diverging answers (which are quite rare at this stage of the competition, and lead to penalties).For each examination, golden, silver, and bronze medals are attributed to the three best tools. CPU usage and memory consumption are reported, which is also valuable information for tool developers.

MCC: A Tool for Unfolding Colored Petri Nets in PNML Format

“…Nonetheless, we believe that it can still be of interest for the Petri net community, and beyond, by enriching the PNML ecosystem. As a matter of fact, there has been a total of 26 verification tools to participate to the MCC since its beginning [1], not all "Petri tools". Many of these tools could benefit from using mcc.…”

“…In this paper we present mcc, a tool designed for the single task of unfolding the models of High-Level Petri nets, given in the PNML syntax, into equivalent Place/Transition nets. The name of the tool derives from the annual Model-Checking Contest (MCC) [1], a competition of "Petri tools" that makes an extensive use of PNML and that provides a large and diverse collection of PNML models, some of which are colored. Our choice when naming mcc was to underline the main focus of the tool, which is to provide an open and efficient solution that lowers the access cost for developers wanting to engage in the MCC.…”

Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues

“…In order to obtain a successful parameterization, we need to have some reason to believe that the parameter is typically small, such that f (k) can be expected to remain relatively small, too. In the absence of a benchmark that is specifically created for Petri net synthesis, we have analyzed the benchmark of the Model Checking Contest (MCC) [39], which contains both academic and industrial Petri nets. Their corresponding TS (reachability graphs) have usually (way) more than 10 7 states, which provides a lower bound for the length n ≥ |S| + |E| of an input TS A = (S, E, δ, ι).…”

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets

“…We also support a generalized notion of reachability properties, in the sense that we can check if it is possible to reach a marking that satisfies a combination of linear constraints between places. This is more expressive than the reachability of a single marking and corresponds to the class of formulas used in the reachability category of the Model Checking Contest (MCC), a yearly competition of formal verification tools for concurrent systems [7,27].…”