Dear Petri-netters,

As you know, the Model Checking Contest is a yearly scientific event dedicated
to the assessment of formal verification tools for concurrent systems. Its main
objective is to benchmark verification tools developed within our scientific
community.

To do so, the Model Checking Contest compares tools on several classes of
models with scaling capabilities (e.g. values that set up the «size» of its
associated state space). Through the feedback on tools efficiency according to
the selected benchmarks, we aim at identifying the techniques that can tackle a
given type of problem (e.g. state space generation, deadlock detection,
reachability analysis, causal analysis).

For 2016, we already have a set of 56 different models (with some having
several instances deduced from parameters, see http://mcc.lip6.fr/models.php
for more details). We are now looking for new instances of models that will be
«surprise» for 2016. It is important that you provide us with such models,
coming from benchmarks of your own tools, or from project you worked to
experiment your research results. Old models from the community are also
welcome. You can provide us with P/T nets or colored nets, the largest (in term
of state space) thy are, the better it is ;-).

You can get more information about the submission of models to the MCC here:

        http://mcc.lip6.fr/cfm.php

Best regards.

Fabrice


--------------------------------------------------------------------------------------
Fabrice Kordon          
Université Pierre & Marie Curie
LIP6/MoVe, Bureau 26/25-212
4 place Jussieu, 75252 Paris Cedex 05
http://lip6.fr/Fabrice.Kordon/ <http://lip6.fr/Fabrice.Kordon/>
----
[[ Petri Nets World:                                                ]]
[[              http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]]
[[ Mailing list FAQ:                                                ]]
[[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]]
[[ Post messages/summary of replies:                                ]]
[[                               [email protected] ]]

Reply via email to