Report on the Model Checking Contest at Petri Nets 2011

Abstract

Abstract. This article presents the results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. The participating tools were compared on several examinations (state space generation, deadlock detection and evaluation of reachability formulae) run on a set of common models (Place/Transition and Symmetric Petri nets). The collected data gave some hints about the way techniques can scale up depending on both examinations and the characteristics of the models. This paper also presents the lessons learned from the organizer's point of view. It discusses the enhancements required for future editions of the Model Checking Contest event at the Petri Nets conference.

Extending Testing Automata to All LTL

“…The models are from the Petri net literature [11], we selected two instances of each of the following models: the Flexible Manufacturing System (4/5), the Kanban system (4/5), the Peterson algorithm (4/5), the slotted-ring system (6/5), the dining philosophers (9/10) and the Round-robin mutex (14/15). We also used two models from actual case studies: PolyORB [10] and MAPK [9].…”

Teaching formal methods: Experience at UPMC and UP13 with CosyVerif

“…These models mostly come from industrial real-time case studies and the Model Checking Contest editions of 2011 [10], 2012 [11] and 2013 [12].…”

CosyVerif: An Open Source Extensible Verification Environment

“…Since CosyVerif relies on Web services, the use of Coloane is not mandatory and verification services can be accessed directly The CosyVerif project also provides a repository of models, that may be used for benchmark purposes. These models mostly come from industrial real-time case studies and the Model Checking Contest in 2011 [2] and 2012 [3].…”