Model Checking Contest @ Petri Nets, Report on the 2013 edition
Fabrice Kordon, Alban Linard, Marco Beccuti, Didier Buchs, Łukasz Fronc, Lom-Messan Hillah, Francis Hulin-Hubard, Fabrice Legond-Aubry, Niels Lohmann, Alexis Marechal, Emmanuel Paviot-Adet, Franck Pommereau, César Rodríguez, Christian Rohr, Yann Thierry-Mieg, Harro Wimmel, Karsten Wolf
** * * (cid:77) (cid:111)(cid:100)(cid:101)(cid:108) (cid:67) (cid:104)(cid:101)(cid:99)(cid:107)(cid:105)(cid:110)(cid:103) (cid:67) (cid:111)(cid:110)(cid:116)(cid:101)(cid:115)(cid:116) @ (cid:80)(cid:101)(cid:116)(cid:114)(cid:105) (cid:78)(cid:101)(cid:116)(cid:115)(cid:82)(cid:101)(cid:112)(cid:111)(cid:114)(cid:116) (cid:111)(cid:110) (cid:116)(cid:104)(cid:101) (cid:50)(cid:48)(cid:49)(cid:51) (cid:101)(cid:100)(cid:105)(cid:116)(cid:105)(cid:111)(cid:110) September 2013
F. Kordon, A. Linard,M. Beccuti, D. Buchs, Ł. Fronc, L.M. Hillah,F. Hulin-Hubard, F. Legond-Aubry, N. Lohmann, A. Marechal,E. Paviot-Adet, F Pommereau, C. Rodríguez, C. Rohr,Y. Thierry-Mieg, H. Wimmel, K. Wolf * * * able of Contents
Report on the Model Checking Contest at Petri Nets 2013 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
F. Kordon, A. Linard, M. Beccuti, D. Buchs, Ł. Fronc, L.M. Hillah, F. Hulin-Hubard, F.Legond-Aubry, N. Lohmann, A. Marechal, E. Paviot-Adet, F. Pommereau, C. Rodríguez, C.Rohr, Y. Thierry-Mieg, H. Wimmel, and K. Wolf
I Organization of the Model Checking Contest
MCC’2011 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72.2 Models from the
MCC’2012 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72.3 Models from the
MCC’2013 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.4 List of Model Contributors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102.5 How Models where supported by tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 Participating Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133.1
AlPiNA (Univ. Geneva, Switzerland) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133.2
Cunf (École Normale Supérieure de Cachan, France) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133.3
GreatSPN (Univ. Torino, Italy) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143.4
ITS − Tools (Univ. Pierre & Marie Curie, France) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143.5
LoLA (Univ. Rostock, Germany) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143.6
Marcie (Univ. Cottbus, Germany) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153.7
Neco (Univ. Evry-Val-d’Essone, France) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153.8
PNXDD (Univ. Pierre & Marie Curie, France) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163.9
Sara (Univ. Rostock, Germany) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163.10 Summary of the Techniques Reported by Participating Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 Evaluation Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184.1 The Examinations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184.2 Execution Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194.3 Involved Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194.4 The Executions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204.5 Know Issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
II State Space Generation
III Reachability Analysis eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
IV CTL-based Analysis
13 The CTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19313.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19313.2 Outputs for the CTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20113.3 Score for the CTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20713.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21214 The CTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21414.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21414.2 Outputs for the CTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22314.3 Score for the CTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22914.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23415 The CTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23515.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23515.2 Outputs for the CTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24015.3 Score for the CTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24615.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25116 The CTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25316.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25316.2 Outputs for the CTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26116.3 Score for the CTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26716.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27217 The CTLMix Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27417.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27417.2 Outputs for the CTLMix Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
V LTL-based Analysis
18 The LTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29718.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29718.2 Outputs for the LTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30518.3 Score for the LTLCardinalityComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31118.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31619 The LTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31819.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31819.2 Outputs for the LTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32719.3 Score for the LTLFireability Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33319.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33820 The LTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33920.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33920.2 Outputs for the LTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34420.3 Score for the LTLMarkingComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35020.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35521 The LTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35721.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35721.2 Outputs for the LTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36521.3 Score for the LTLPlaceComparison Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37121.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37622 The LTLMix Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37822.1 Handling of Models by Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37822.2 Outputs for the LTLMix Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38622.3 Score for the LTLMix Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39222.4 Trophies for this Examination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 403 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. eport on the Model Checking Contestat Petri Nets 2013
F. Kordon , A. Linard ,M. Beccuti , D. Buchs , Ł. Fronc , L.M. Hillah , F. Hulin-Hubard , F. Legond-Aubry ,N. Lohmann , A. Marechal , E. Paviot-Adet , F. Pommereau , C. Rodríguez , C. Rohr ,Y. Thierry-Mieg , H. Wimmel , and K. Wolf LIP6, CNRS UMR 7606, Université P. & M. Curie – Paris 64, place Jussieu, F-75252 Paris Cedex 05, France
[email protected] , [email protected] LSV, Inria/École Normale Supérieure de Cachan,61, avenue du Président Wilson, Cachan, France
[email protected] , [email protected] , [email protected] Dipartimienti di Informatica, Univ. di TorinoCorso Svizzera, 185, 10149 Torino, Italy [email protected] Centre Universitaire d’Informatique, Université de Genève7, route de Drize, CH-1227 Carouge, Switzerland
[email protected] IBISC, Université d’Évry Val d’Essonne22 Boulevard de France, 91037 Évry Cedex France [email protected] , [email protected] Universität Rostock, 18051 Rostock, Germany [email protected] , [email protected] , [email protected] Brandenburg University of Technology at CottbusPostbox 10 13 44, 03013 Cottbus, Germany [email protected] LIP6, CNRS UMR 7606 and Université Paris Ouest Nanterre La Défense200, avenue de la République, F-92001 Nanterre CEDEX, FRANCE
[email protected] , [email protected] LIP6, CNRS UMR 7606 and Université Ren ´Descartes143 Avenue de Versailles, 75016, Paris, France
Abstract.
This document presents the results of the Model Checking Contest held at Petri Nets 2013in Milano. This contest aimed at a fair and experimental evaluation of the performances of modelchecking techniques applied to Petri nets. This is the third edition after two successful editions in2011 [34] and 2012 [33].The participating tools were compared on several examinations (state space generation and evalu-ation of several types of formulæ – reachability, LTL, CTL for various classes of atomic propositions)run on a set of common models (Place/Transition and Symmetric Petri nets).After a short overview of the contest, this paper provides the raw results from the contest, model permodel and examination per examination. An HTML version of this report is also provided [32].
Keywords:
Petri Nets, Model Checking, Contest. eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. art I Organization of theModel Checking Contest eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
When verifying by model checking a system with formal methods, such as
Petri nets , one may haveseveral questions such as:“When creating the model of a system, should we use structural analysis or an explicit modelchecker to debug the model?”“When verifying the final model of a highly concurrent system, should we use a symmetry-based or a partial order reduction-based model checker?”“When updating a model with large variable domains, should we use a decision diagram-based or an abstraction-based model checker?”Results that help to answer these questions are spread among numerous papers in numerous con-ferences. The choice of the models and tools used in benchmarks is rarely sufficient to answer thesequestions. Benchmark results are available a long time after their publication, even if the computer ar-chitecture has changed a lot. Moreover, as they are executed over several platforms and composed ofdifferent models, conclusions are not easy.The objective of the
Model Checking Contest @ Petri nets is to compare the efficiency of verificationtechniques according to the characteristics of the models. To do so, the
Model Checking Contest com-pares tools on several classes of models, often with scaling capabilities, e.g. , values that set up the “size”of the associated state space.Through a benchmark, our goal is to identify the techniques that can tackle a given type of problemidentified in a “typical model”, for a given class of problem ( e.g. , state space generation, evaluation ofreachability or temporal formulaæ, etc.).After Newcastle and Hamburg, the third edition of the
Model Checking Contest @ Petri nets tookplace within the context of the Petri Nets 2013 conference, in Milano, Italy. The original submissionprocedure was published early mid-February 2013 and submissions gathered by early May 2013. Aftersome tuning of the execution environment, the evaluation procedure was operated on a cluster earlyJune. Results were presented during on June 25th, 2013.The goal of this document is to report the raw data provided by this third edition of the Model Check-ing Contest. It reflects the vision of the
MCC’2013 organizers, as it was first presented in Milano. All tooldevelopers are listed in Section 5.Please note that a web version of this this report (with hyperlinks) is also available at http://mcc.lip6.fr [32].
Structure of this report
The report for the
MCC’2013 is divided in three volumes: – the main document (the on you read now) that contains all the main data gathered during this event, – two annexes that only report memory and CPU consumption of tool executions (these shouldmostly interest tool developers).Annex 1 concerns state space generation and reachability examinations (1378 pages) while annex 2deals with CTL and LTL examinations (1732 pages).The main document is structured in five parts. The first one deals with factual information aboutmodels (section 2), involved tools (section 3), the methodology (section 4) and a a short conclusion.Other parts are almost completely generated automatically from the outputs gathered during themodel checking contest. They deal with the state space examination (part II), Reachability analysis ex-aminations (part III), CTL analysis examinations (part IV) and LTL analysis examinations (part V).5 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. This year, there was 28 models. Some of them being colored, they were proposed in two versions: P/Tand colored. This made a total of 38 and, if we consider that many of them were proposed with severalinstances of scaling parameters (values that could set up the size of the state space), the final benchmarkcontained a total of 255 instances as shown in table 1.
Year Model f r o m M CC ’ FMS (P/T, 8 instances)Kanban (P/T, 8 instances)MAPK (P/T, 6 instances)Peterson (Colored, 6 instances)Peterson (P/T, 6 instances)Philosophers (colored, 13 instances)Philosophers (P/T, 11 instances)SharedMemory (colored, 14 instances)SharedMemory (P/T, 6 instances)TokenRing (colored, 7 instances)TokenRing (P/T, 4 instances) f r o m M CC ’ CSRepetitions (Colored, 6 instances)CSRepetitions (P/T, 6 instances)Echo (P/T, 9 instances)Eratosthenes (P/T, 8 instances)GlobalRessAlloc (Colored, 7 instances)GlobalRessAlloc (P/T, 2 instances)LamportFastMutEx (Colored, 7 instances)LamportFastMutEx (P/T, 7 instances)NeoElection (Colored, 7 instances)NeoElection (P/T, 7 instances)PhilosophersDyn (colored, 5 instances)PhilosophersDyn (P/T, 3 instances)Planning (P/T, 1 instance)Railroad (P/T, 6 instances)Ring (P/T, 1 instance)RwMutex (P/T, 12 instances)SimpleLoadBal (colored, 5 instances)SimpleLoadBal (P/T, 5 instances) f r o m M CC ’ Dekker (P/T, 6 instances)DotAndBoxes (Colored, 4 instances)DrinkVendingMachine (Colored, 2 instances)DrinkVendingMachine (P/T, 2 instances)
HouseConstruction (P/T, 8 instances)IBMB2S565S3960 (P/T, 1 instance)
PermAdmissibility (Colored, 6 instances)PermAdmissibility (P/T, 6 instances)
QuasiCertifProtocol (Colored, 6 instances)QuasiCertifProtocol (P/T, 6 instances)
RessAllocation (P/T, 15 instances)
Vasy2003 (P/T, 1 instance)
Table 1.
Summary of the Models processed for the
MCC’2013 .For the
MCC’2013 , models were classed in two types: – “known” models where known when the call for tool participation was issued and tool developerscould choose the best technique to model these according to the capacity of their tool. Their analysisshow the performance of the tool when it is used by people having a good knowledge of its internals; – “surprise” models (in bold in table 1) models where decided at the very last moment and come fromvarious origins. To process these, tools had to use the provided PNML format and tool developers6 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. could not anticipate any tuning for their tool. Their analysis shows the performance of the tool whenit is used by non experts using the “default settings” of the tool. MCC’2011
These models are from the
MCC’2011 . In this set,
MAPK is the only model coming from anindustrial-like case study (biology).
FMS belongs to the
GreatSPN and
SMART [14] benchmarks. It models a
Flexible Manufacturing Sys-tem [13]. The scaling parameter corresponds to the number of initial tokens held in three places. Thefollowing values were used: 2,5,10,20,50,100,200,500.
Kanban [12] models a Kanban system. The scaling parameter corresponds to the number of initialtokens held in four places. The following values were used: 5,10,20,50,100,200,500,1000.
MAPK models a biological system: the
Mitogen-Activated Protein Kinase Kascade [26]. The scalingparameter changes the initial number of tokens held in seven places. The following values were used:8,20,40,80,160,320.
Peterson models
Peterson’s mutual exclusion algorithm [38] in its generalized version for N processes.This algorithm is based on shared memory communication and uses a loop with N − Philosophers models the famous
Dining Philosophers problem introduced by E.W. Dijkstra in 1965 [47]to illustrate an inappropriate use of shared resources, thus generating deadlocks or starvation. The scal-ing parameter is the number of philosophers. The following values were used: 5, 10, 20, 50, 100, 500,1000, 5000, 10000, 50000, 100000. For P/T models, due to the size of the PNML file, the two last scalingparameters were not proposed.
SharedMemory is a model taken from the
GreatSPN benchmarks [10]. It models a system composedof P processors competing for the access to a shared memory (built with their local memory) using aunique shared bus. The scaling parameter is the number of processors. The following values were used:5,10,20,50,100,200,500,1000,2000,5000,10000,20000,50000. For P/T models, to avoid too large PNMLfiles, the values over 200 were not proposed TokenRing is another problem proposed by E.W. Dijkstra [18]. It models a system where a set of ma-chines is placed in a ring, numbered 0 to N −
1. Each machine i only knows its own state and the stateof its left neighbor, i.e., machine ( i −
1) mod ( N ). Machine number 0 plays a special role, and it is calledthe “bottom machine”. A protocol ensuring non-starvation determines which machine has a “privilege”(e.g. the right to access a resource). The scaling parameter is the number of machines. The followingvalues were used: 5,10,20,50,100,200,500. For P/T models, to avoid huge PNML files, the values up to50 were proposed. MCC’2012
These models were submitted by the community for the
MCC’2012 . Several are coming from largercase studies:
NeoElection , Planning , and
Ring . CSRepetitions models a client/server application with C clients and S servers. Communication fromclients to servers is not reliable, with requests stored in a buffer of size B . Communication from serversto clients are reliable. A client send its message until it receives an answer. The scaling parameter is afunction of C for a fixed number of severs. The following values were used: 2,3,4,5,7,10. Echo
This file specifies the Echo Algorithm (see [41]) for grid like networks. It is a protocol for propaga-tion of information with feedback in a network. A distinguished agent (initiator), starts the distribution7 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. of a message by sending it to all its neighbors. On receiving some first message, every other agent for-wards the message to all its neighbors, except the one it received its first message from. Then it awaitsmessages from all recipients of its forwards (regardless whether these messages had been intended asforwards or acknowledgments) and replies to the agent where it received its first message from. As soonas the initiator receives a message from all its neighbors, the protocol terminates. In this example, agentsare arranged in a hypercube that can be scaled in two values: d , the number of dimensions and r , thenumber of agents per dimensions . The scaling parameter is a combination of d and r . The followingvalues were used: d02r09, d02r11, d02r15, d02r19, d03r03, d03r05, d03r07, d04r03, d05r03. Eratosthenes
This model implements the sieve of Eratosthenes [48]. The scaling parameter is the sizeof the sieve. The following values were used: 5,10,20,50,100,200,500.
GlobalRessAlloc
It models the deadlock-free management of mutually exclusive resources known asthe “global allocation strategy” [36]. When a process enters a critical section, it locks all the resourcesneeded to be used in the critical section (in the model, 4 max). Then, it can release a subset of theseresources (max 2 in the model) at a time (and then stay in the critical section) or exit the critical section,thus releasing all the remaining resources it locks. The scaling parameter is a value N for N processesand N × LamportFastMutEx
It models Lamport’s fast mutual exclusion algorithm designed for multi-processor architectures with a shared memory and was studied in [30]. The scaling parameter is thenumber of processes competing for the critical section. The following values were used: 2,3,4,5,6,7,8.
NeoElection
The Neo protocol aims at managing large distributed databases on clusters of worksta-tions. The machines on the cluster may have several roles. This model focusses on master nodes whichhandle the communications between all nodes, and in particular requests for accessing database ob-jects. Prior to that all master nodes agree on a primary master which will be the operating one, the othermaster nodes being secondary, waiting to replace the primary master if needed. This model specifiesthis election algorithm [11]. The scaling parameter is the number of master nodes. The following valueswere used: 2,3,4,5,6,7,8.
PhilosophersDyn is a variation of the Dining Philosophers where philosophers can join or quit the ta-ble [9]. Each philosopher has its own fork, as in the usual version. The interesting point is that identifiersof left and right for each philosopher must be computed or stored somewhere. A philosopher can enterthe table only if the two forks around his position are available. He can leave if his fork is free, and heis thinking. The scaling parameter is the maximum number of philosophers. The following values wereused: 3,10,20,50,80. To avoid huge PNML files, only 3, 5 and 10 values were proposed for the scalingparameter.
Planning
It models the equipment (displays, canvases, documents, and lamps) of a smart conferenceroom of the University of Rostock. It was derived from a proprietary description format that was used byan AI planning tool to generated plans to bring the room in a desired state, for instance displaying a doc-ument on a certain canvas while switching off the lights. This problem can be expressed as a reachabilityproblem. This model has no scaling parameter.
Railroad it corresponds to the Petri nets semantics of an ABCD model of a railroad crossing system. thas three components: a gate sub-net, a controller sub-net and n tracks sub-nets that differ only by anidentifier k in {0,..., n − eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Ring
It models a three-module ring architecture [17]. The communication architecture contains asmany channels as there are modules. It tests the occurrence of global deadlock arising from a local one.It uses stoppable clocking scheme on arbitrated input and output channels. This model has no scalingparameter.
RwMutex
It models a system with readers and writers [41]. Reading can be conducted concurrentlywhereas writing has to be done exclusively. This is modeled by a number of semaphores (one for eachreader) that need to be collected by a writer prior to writing. The scaling parameter a combination of r ,the number of readers and w , the number of writers. The following values were used: r w r w r w r w r w r w r w r w r w r w r w r w SimpleLoadBal models a simple load balancing system composed of a set of clients, two servers, andbetween these, a load balancer process. The scaling parameter is the number of clients to be balancedover the servers. The following values were used: 2,5,10,15,20.
MCC’2013
In 2013, models were introduced in two steps: “known” models first, and then “surprise” models thatenforce tools to work wth their default settings. Among these models (both classes), several came fromcase studies:
DrinkVendingMachine , IBMB2S565S3960 , PermAdmissibility , QuasiCertifProtocol
Dekker is a 1-safe P/T net representing a variant of the Dekker’s mutual exclusion algorithm for N > p0 , p1 , and p3 . p0 is initial. From there, the process executes try and raises its flag , reaching p1 . In p1 , if at least one of the other process has a high flag , it withdraw s itsintent and goes back to p0 . In p1 , it enter s the critical section if all other process’ flag is zero. From p3 , theprocess can only exit the critical section. Mutual exclusion and deadlock-freedom is guaranteed. Unfairruns are however possible. The scaling parameter is the number of involved processes. The followingvalues where used: 10, 15, 20, 50, 100, 200. DotAndBoxes models a pencil and paper game you have certainly played in your childhood: from anempty grid of dots, two players add, in turn, a line between two adjacent dots. The player that finishes abox owns it and can play again. The game ends when all possible lines are drawn and the winner is theplayer that owns the larger number of boxes. Exceptionally, no P/T equivalent net was provided for thiscolored net. The scaling parameter defines the size of the square grid. The following values where used:2, 3, 4, 5.
DrinkVendingMachine is a colored net modeling a simple hot drink vending machine [37]. Thismodel handles cycles of elaborations of a hot drink (
Products ). Each type of elaboration (modelled bythe elaborateX transitions) carries a set of options (
Options ) for the product. For elaborate0 the set ofoptions is empty. Products and options are restaured from the places productSlots and optionSlots . Eachtype of elaboration has an intrinsic quality level range (
Quality ), which is associated with the service.The cardinal of the set of quality levels is M = × N , N being the number of products. N is the scalingparameter. We used the following values: 2, and 10. HouseConstruction (“surprise” model) comes from the petriweb.org repository (see ). According to the provided information, the net was designed by J. L. Peterson [39], froma PERT chart by F. Levy. The PERT chart contains timing information, which is not accurately translated.The scaling parameter is artificially set to the number of houses to be constructed in parallel. We usedthe following values: 2, 5, 10, 20, 50, 100, 200, 500.
IBMB2S565S3960 (“surprise” model) is the biggest one (273 places, 179 transition, 572 arcs) of a col-lection of 1386 Petri nets that were derived from industrial business process models that were providedby IBM [21]. The Petri nets have workflow structure (unique source and sink place) and can be checkedfor soundness (marking the source place, does the CTL formula “AGEF sink” hold). More information onthe models can be found in the referenced paper. There is no scaling parameter for this model.9 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility describes a 8 × QuasiCertifProtocol (“surprise” model) models a quasi certification protocol on top of a DHT [6]. Inthis protocol, an Actor A contact a server S (key k = hash ( S ) for the corresponding root node in the DHT)to perform a service. Once S has finished, S contact C (key k (cid:48) = hash ( A + S ) for the corresponding rootnode in the DHT) that will certify that A did a service S at a timestamp t . To get this certificate, any Xcontact C for his answer.This service relies on numerous algorithms scheduled by means of a protocol. Reliability over theDHT is ensured by replication over “leaf sets” of size L (we assume it is the same value for S and C). ThePetri net models this protocol where A, S and C interact. The objective is to certify that either one actorbehave maliciously (i.e. does not respect the protocol) and then no certification is issued or, if all is OK,one certificate is appropriately emitted. The scaling parameter is the size of the leafsets for S and C. weuse the following values: 2, 6, 10, 18, 22, 28, 32. RessAllocation is issued from [46]. It models a kind of chessboard, whose dimensions are nR ( nR ≥ nC ≥ K ≥
1) for holding ants.We then consider ant processes which traverse the board, either North-South or South-North directions,always jumping from one position to the following one. For safety reasons each ant, before jumping tothe next position, books the position he is going to jump over and also the adjacent one in the west sideof the target position. Of course, because of the position capacity constraint, no more than K ants canstay simultaneously in the same position.In the set of considered specific models, even columns correspond to North-South ant processes,while odd columns correspond to South-North ant processes. The figure sketches a particular boardmodel for nR=3 , nC=5 and K=1 .The system can be parametrized in three ways, varying each one of nR, nC and K (here K=1). Whenvarying nR we will call the model a RAS-R, and when varying nC we will call it a RAS-C. The values weused for this couple of scaling parameters are: (2, 2), (2, 3), (2, 5), (2, 10), (2, 15), (2, 20), (2, 50), (2, 100),(3, 3), (3, 5), (3, 10), (3, 15), (3, 20), (3, 50), (3, 100), (5, 2), (10, 2), (15, 2), (20, 2), (50, 2), (100, 2).
Vasy2003 (“surprise” model) was submitted to the Petri net mailing list on July 28, 2003 [24]. It orig-inates from an industrial case study, namely a model (8,500 lines of LOTOS and 3,000 lines of C) devel-oped by Bull for it FAME high-end multiprocessor architecture. The source code of this model (in LOTOSand C) was automatically translated into an interpreted Petri net using the CÆSAR compiler of the CADPtoolbox. The present benchmark was obtained by removing all data information (namely, data types,variables, conditions, actions, offers) from the interpreted Petri net in order to obtain a place/transitionPetri net. At the time it was submitted, three Petri net tools had failed to handle this benchmark due to alack of memory (there are nearly 9.810 reachable markings). After the submission, four tools managedto process the benchmark, entirely or at least in part. The purpose of this example is to check how toolcapabilities have improved during the last ten years.There is no scaling parameter. Some of the formula submitted to the tools were issued from theoriginal specification. Models were submitted by several people among the community over the successive editions of theModel Checking Contest. Sometime, they are authors of these models, otherwise, they have summarizedor retrieved an existing model from the literature... thus, they are "responsible" for these and, since theywere of great help for establishing the base of our benchmark, we list them here below:10 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – J. Espeleta & F. Trica Garcia (Univ. Zaragoza, Spain): RessAllocation – S . Evangelista (Univ. Paris 13, France): LamportFastMutEx, NeoElection, SimpleLoadBal – H. Garavel (Inria, France): Vasy2003 – L. Hillah (Univ. Paris Ouest Nanterre): DrinkVendingMachine, FMS, Kanban, MAPK, Philosopher,SharedMemory – F. Kordon (Univ. P. & M. Curie, France): GlobalRessAlloc, HouseConstruction, PermAdmissibility,QuasiCertifProtocol – A. Linard (ENS de Cachan, France): CSRepetition, PhilosophersDyn – N. Lohmann (Univ. Rostock, Germany): Echo, IBMB2S565S3960, PLanning, Ring, RwMutex – A. Marechal (Univ. Geneva, Switzerland): TokenRing – E. Paviot-Adet (Univ. René Descartes, France): DotAndBoxes, Peterson – F. Pommereau (Univ. Evry Val d’Essone, France): Eratosthenes, Railroad – C. Rodríguez (ENS de Cachan, France): Dekker
We report here how difficult models where for tools in general. Please find below the signification ofthe icons used in table 2: – : no tool could process any instance of this model for this examination. – : less than 33% of the tools could process at least one instance of this model for this examination. – : 33-66% of the tools could process at least one instance of this model for this examination. – : 66% or more tools could process at least one instance of this model for this examination.In the tables below, the first line of the header shows the class of the verified formulas while thesecond one shows the type of atomic proposition formulas may contain: cardinality comparison , fire-ability , marking comparison , place comparison and a mix of these. For reachability formulas, we alsorefer to the presence of at least one deadlock . The last column refers to state space generation. Model Name CTL LTL Reachability C a r d . C o m p . F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . C a r d . C o m p . F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . C a r d . C o m p . D e a d l o c k F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . S t a t e S p a c e “Known” Models CSRepetitions (colored)CSRepetitions (P/T)Dekker (P/T)DotAndBoxes (colored)DrinkVendingMachine (colored)DrinkVendingMachine (P/T)Echo (P/T)Eratosthenes (P/T)FMS (P/T)GlobalRessAlloc (colored)GlobalRessAlloc (P/T)Kanban (P/T)LamportFastMutEx (colored) .../...11 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Model Name CTL LTL Reachability C a r d . C o m p . F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . C a r d . C o m p . F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . C a r d . C o m p . D e a d l o c k F i r e a b i l i t y M a r k i n g . C o m p . M i x P l a c e C o m p . S t a t e S p a c e LamportFastMutEx (P/T)MAPK (P/T)NeoElection (colored)NeoElection (P/T)PermAdmissibility (colored)PermAdmissibility (P/T)Peterson (colored)Peterson (P/T)Philosophers (colored)Philosophers (P/T)PhilosophersDyn (colored)PhilosophersDyn (P/T)Planning (P/T)Railroad (P/T)RessAllocation (P/T)Ring (P/T)RwMutex (P/T)SharedMemory (colored)SharedMemory (P/T)SimpleLoadBal (colored)SimpleLoadBal (P/T)TokenRing (colored)TokenRing (P/T) “Surprise” Models
HouseConstruction (P/T)IBMB2S565S3960 (P/T)QuasiCertifProtocol (colored)QuasiCertifProtocol (P/T)Vasy2003 (P/T)
Table 2.
Summary of the way tools handle models12 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Twelve tools were submitted at
MCC’2013 (including the variants of one tool). We list them here byalphabetical order. For each submitted tool, the disk image used to operate them is available from theMCC web page (section Participating tools) [32].
AlPiNA (Univ. Geneva, Switzerland)
AlPiNA [7,8,29] stands for Algebraic Petri Nets Analyzer and is a model checker for Algebraic PetriNets created by the SMV Group at the University of Geneva. It is 100% written in Java and it is availableunder the terms of the GNU general public license. Our goal is to provide a user friendly suite of toolsfor checking models based of the Algebraic Petri Net formalism. AlPiNA provides a user-friendly userinterface that was built with the latest metamodeling techniques on the eclipse platform.Usually, the number of states of concurrent systems grows exponentially in relation to the size ofthe system. This is called the State Space Explosion. Symbolic Model Checking (SMC) and particularlySMC based on Decision Diagrams is a proven technique to handle the State Space Explosion for simpleformalisms such as P/T Petri nets.Algebraic Petri Nets (APN : Petri Nets + Abstract Algebraic Data Types) are a powerful formalism tomodel concurrent systems. The State Space Explosion is even worse in the case of the APNs than in theP/T nets, mainly because their high expressive power allows end users to model more complex systems.To tackle this problem, AlPiNA uses evolutions of the well known Binary Decision Diagrams (BDDs),such as Data Decision Diagrams, Set Decision Diagrams and Sigma-DDs. It also includes some opti-mizations specific to the APN formalism, such as algebraic clustering and partial algebraic unfolding,to reduce the memory footprint. With these optimizations, AlPiNA provides a good balance betweenuser-friendliness, modeling expressivity and computational performances.AlPiNA official web page is http://alpina.unige.ch . Cunf (École Normale Supérieure de Cachan, France)
Cunf is a set of programs for carrying out unfolding-based verification of Petri nets extended withread arcs, also known as contextual nets, or c-nets. The package specifically contains the following tools: – Cunf: constructs the unfolding of a c-net, – Cna: performs reachability and deadlock analysis using unfoldings constructed by Cunf, – Scripts such as pep2dot or grml2pep to do format conversion between various Petri net formats,unfolding formats, etc.The unfolding of a c-net is another well-defined c-net of acyclic structure that fully represents thereachable markings of the first. Because unfolding represent behavior by partial orders rather than by in-terleaving, for highly concurrent c-nets, unfolding are often much (exponentially) smaller, which makesfor natural interest in them for the verification of concurrent systems.Cunf requires that the input c-net is 1-safe (i.e., no reachable marking puts more than one token onevery place), and for the time being the tool will blindly assume this. It implements the c-net unfoldingprocedure proposed by Baldan et al. in [4], the algorithms and data structures actually implementedhave been partially described in [3].Cna (Contextual Net Analyzer), checks for place coverability or deadlock-freedom of a c-net by ex-amining its unfolding. The tool reduces these problems to the satisfiability of a propositional formulathat it generates out of the unfolding, and uses Minisat as a back-end to solve the formula.You may download the tool’s manual from the tool’s webpage, where you will find detailed instruc-tions for installation. The tool is integrated in the Cosyverif environment, whose graphical editor youmay want to use to analyze nets constructed by hand. Cunf also comes with Python libraries for produc-ing c-nets programmatically, see Sec. 7 of the manual.Cunf official web page is http://code.google.com/p/cunf . Cunf is also distributed within theCosyVerif environment ( http://cosyverif.org ).13 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN (Univ. Torino, Italy)
GreatSPN [1,2] is a suite of tools for the design and analysis (qualitative and quantitative) of Gener-alized Stochastic Petri Nets and Stochastic Well-formed nets. First released by the University of Torinoin the late 1980’s, GreatSPN has been a widely used tool in the research community since it provides abreadth of solvers for computing net structural properties, the set of Reachable States (RS), the Reach-ability Graph (RG) with and without symmetry exploitation, and performance evaluation indices usingboth simulation and numerical solution for steady state and transient measures.Over the years, GreatSPN functionality has been extended, also thanks to the collaboration with Uni-versity of Paris 6 and the Università del Piemonte Orientale, by improving and enhancing its solution al-gorithms, and by providing new solution methods for new formalisms and property languages definedover the years.The last enhancements include: – Model checking. A Computational Tree Logic (CTL) model checker for Petri nets with priorities anda CSL-TA stochastic model checker for SPN. The CTL model checker implementation is based onthe Meedly library from University of Iowa. – Optimization problem analyzer. Integration of the Markov Decision Well-formed Net formalism andassociated solution algorithms, which allow the study of optimization problems based on DiscreteTime Markov Decision Process. – Fluidification analysis. The addition of the PN2ODE module, which allows to automatically derivefrom an SPN model a corresponding set of ODEs (in Matlab format), whose solution provides theexpected values of the performance indices, as a function of time. – Dynamic SRG and Extended SRG. The algorithms for the construction of the Symbolic RG have beenextended to include Dynamic SRG and Extended SRG construction, two non trivial extensions of theSRG construction which can provide a reduction of the state space size in case of partially symmet-rical SWN models.GreatSPN official web page is . ITS − Tools (Univ. Pierre & Marie Curie, France)
ITS-tools is a suite of model-checking tools, developed in the team MoVe at LIP6. Written in C++, itis available under the terms of the GNU General Public License.It features state-space generation, reachability analysis, LTL and CTL checking. ITS-tools accept awide range of inputs: (Time) Petri Nets, ETF (produced by the tool LTSmin), DVE (input format to the toolDiVinE, used in the BEEM database), and a dedicated C-like format known as GAL. The input modelscan also be given as compiled object files. This allows for large possibilities of interaction with othertools.Models, even in different formats, can also be easily composed, through the formalism of Instan-tiable Transition Systems (ITS) [44]. This ease the modeling process. ITS-tools also features a graphicalinterface, as an Eclipse plug-in, to further help the modeler, especially with compositions.As for the back-end, ITS-tools rely on decision diagrams [16] to handle efficiently the combinatorialexplosion of the state space. The decision diagrams manipulation is performed by the libDDD library,that features several mechanisms for the efficient manipulation of decision diagrams [25,15].ITS-Tool official web page is http://move.lip6.fr/software/DDD/itstools.php . LoLA (Univ. Rostock, Germany)
LoLA [50] provides explicit state space verification for place/transition nets. It supports various sim-ple properties. For the contest, mainly the reachability verification features are used.LoLA offers several techniques for alleviating state explosion, including various stubborn set meth-ods, symmetries (which it can determine fully automated), the sweep-line method (where it computesits own progress measure), bloom filters, and linear algebraic compressions. To our best knowledge,LoLA is the only tool worldwide that provides this large number of explicit state space techniques in thishigh degree of automaton, and with these possibilities for joint application.14 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
In the MCC, we neither use symmetries nor the sweep-line method. For these methods, performanceis too volatile for the black box scenario implemented in the MCC.NOTE: associated to he main version, three variants (described below) were provided.LoLA official web page is . Variant:
LoLa optimistic
It uses a goal oriented stubborn set method and linear algebraic statecompression. Goal oriented stubborn sets perform best on reachability queries that are ultimately sat-isfied in the net under investigation. A heuristics takes care that a satisfying state is reached with highprobability already in very early stages of state space exploration. This way, only a tiny portion of thestate space is actually explored. If the satisfying states are missed, however, or no satisfying state is reach-able, a significantly larger state space is produced than the one produced by lola-pessimistic. Witnesspaths tend to be very small.
Variant:
LoLa optimistic incomplete
In addition to lola-optimistic, we use a bloom filter for in-ternal representation of states. That is, only the hash value of a state is marked in several hash tables,each belonging to an independent hash function. The state itself is not stored at all. This way, we canhandle a larger number of states within a given amount of memory. In the rare case of a hash collision,the colliding state is not explored, so parts of the state space may be missed and false negative resultsare possibleThe user can specify the number of hash tables to be used and thus control the probability of hashcollisions.
Variant:
LoLa pessimistic
This variant computes stubborn sets using a standard deletion algo-rithm. Deletion algorithms are much slower than goal-oriented stubborn sets (quadratic instead of lin-ear) but yield better reduction. This better reduction pays off when the whole state space needs to beexplored (i.e. there are no reachable satisfying states). If reachable states exist, this variant is outper-formed by the optimistic variant since it has no goal-orienting heuristics and tends to miss reachablestates in early phases of state space exploration.Witness paths are often much longer than in the optimistic variant.
Marcie (Univ. Cottbus, Germany)
MARCIE [27] is a tool for the analysis of Generalized Stochastic Petri Nets, supporting qualitative andquantitative analyses including model checking facilities. Particular features are symbolic state spaceanalysis including efficient saturation-based state space generation, evaluation of standard Petri netproperties as well as CTL model checking.Most of MARCIE’s features are realized on top of an Interval Decision Diagram (IDD) implemen-tation [45]. IDDs are used to efficiently encode interval logic functions representing marking setsof bounded Petri nets. This allows to efficiently support qualitative state space based analysis tech-niques [43]. Further, MARCIE applies heuristics for the computation of static variable orders to achievesmall DD representations.For quantitative analysis MARCIE implements a multi-threaded on-the-fly computation of the un-derlying CTMC [42]. It is thus less sensitive to the number of distinct rate values than approaches basedon, e.g., Multi-Terminal Decision Diagrams. Further it offers symbolic CSRL model checking and permitsto compute reward expectations. Additionally MARCIE provides simulative and explicit approximativenumerical analysis techniques.MARCIE official web page is . Neco (Univ. Evry-Val-d’Essone, France)
Neco is a suite of Unix tools to compile high-level Petri nets into libraries for explicit model-checking.These libraries can be used to build state spaces. It is a command-line tool suite available under the GNULesser GPL. 15 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Neco compiler is based on SNAKES [40] toolkit and handles high-level Petri nets annotated witharbitrary Python objects. This allows for big degree of expressivity. Extracting information form models,Neco can identify object types and produce optimized Python or C++ exploration code. The later is doneusing the Cython language. Moreover, if a part of the model cannot be compiled efficiently a Pythonfallback is used to handle this part of the model.The compiler also performs model based optimizations using place bounds [23] and control flowplaces for more efficient firing functions. However, these optimizations are closely related to a modelinglanguage we use which allows them to be assumed by construction. Because the models from the contestwere not provided with such properties, these optimizations could not be used.The tool suite provides tools to compile high-level Petri nets and build state spaces but this year wealso provide a LTL model-checker: Neco-spot. It builds upon Neco and upon Spot [20,22], a C++ libraryof model-checking algorithms.Neco official web page is https://code.google.com/p/neco-net-compiler . PNXDD (Univ. Pierre & Marie Curie, France)
PNXDD is CTL model-checker based on Set Decision Diagrams (SDD) [44] for PT-nets, a variant ofthe decision diagrams (DD) family with hierarchy. Symmetric Petri Nets are handled via an optimizedunfolding [35] (removing places structurally detected as always empty and the associated transitions).Hierarchy paradigm, used together with DDs offers greater sharing possibilities compared to tradi-tional DDs. The ordering of variables in the diagram, a crucial parameter to obtain good performancesin DDs, becomes a new challenge since portions of the model offering similar comportments must bestatically identified to obtain a good hierarchical order. PNXDD relies on heuristics that are describedin [28].PNXDD official web page is http://cosyverif.org (it is integrated in the CosyVerif VerificationEnvironment).
Sara (Univ. Rostock, Germany)
Sara [49] answers reachability queries using the Petri net state equation. From this equation andinequations derived from the query, a linear programming problem is generated and solved using astandard package. If the system does not have solutions, we conclude that there are no reachable statessatisfying the query. Other wise, we obtain a firing count vector which describes candidate firing se-quences.We check whether there is an executable firing sequence for the given vector. If so, we have a reach-able satisfying state and a witness path. If not, we add inequalities that are not satisfied by the spurioussolution. We result in one or more new linear programming problems which enable less serious solu-tions but still cover all feasible solutions. We proceed recursively with the new problems.Sara has excellent performance if the state equation as such rules out reachability, or if an earlysolution reveals reachability. It may be used for unbounded Petri nets. since it does not try to representor to explore the state space.In worst case, Sara will not terminate (otherwise, our approach would contradict the known EX-PSPACE hardness of the general reachability problem).SARA official web page is . During the
MCC’2013 , tools could report the use of identified techniques. We summarize in table 3.Identified techniques were: – Abstractions: the tool exploits the use of abstractions (on the fly state elimination), – Decision Diagrams: the tool uses any kind of decision diagrams, – Explicit: the tool does explicit model checking, – Net Unfolding: the tool uses MacMillan unfolding,16 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – Parallel Processing : the tool uses multithreading, – Structural Reduction: the tool uses structural reductions (Berthelot, Haddad, etc.), – SAT/SMT: the tool uses a constraint solver, – State Compression: the tool uses some compression technique (other than decision diagrams), – Stubborn Sets: the tool uses partial order technique, – Symmetries: the tool exploits symmetries of the system, – Topological: the tool uses structural informations on the Petri net itself (e.g. siphons, traps, S-invariants or T-invariants, etc.) to optimize model checking, – Unfolding to P/T net: the tool transforms colored nets into their equivalent P/T,
Tool Name Reported Technique
AlPiNA Decision DiagramsCunf Net UnfoldingSAT/SMTgreatSPN Decision DiagramsITS-Tools Decision DiagramsStructural ReductionsLoLA (all variants) Explicit model checkingState compressionStubborn setsMarcie Decision DiagramsNeco Explicit model checkingPNXDD Decision DiagramsTopologicalSara SAT/SMTStubborn setsTopological
Table 3.
Summary of the techniques reported to be used by tools for the
MCC’2013
No tool did report a non listed technique (this was possible). In fact, only one core was allocated to each Virtual Machine so no parallelism could be enabled in practice (butno tool reported this feature). eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Roughly, the evaluation methodology was the same as for
MCC’2011 and
MCC’2012 (it is presentedin [34]). The main differences are the following:1. we created more categories for the formula evaluation examinations, to enable a more precise sup-port by tools;2. since the virtual machine-based monitoring experimented in 2012 was a success, a dedicated en-vironment to operate tests (multi-purpose and thus usable in other contexts) was implemented: B ench K it [31]. So, the MCC execution environment is now composed of B ench K it and numerouspost-analysis scripts that gather and integrate data from the outputs delivered by tools. The
MCC’2011 reported numerous problems with formula classification (reachability, CTL, LTL).One of them was the absence of classification for atomic propositions in formula to be verified. Thus,many tools had troubles to support a significative set of formulas.For the
MCC’2013 , we thus also classified the type of atomic propositions they involved. This lead tothe list of examination reported in table 4
Value Signification
StateSpace we ask for state space generation only
CTLCardinalityComparison we evaluate CTL properties dealing with checking cardinality ofmarking only
CTLFireability we evaluate CTL properties dealing with transition fireabilityonly
CTLMarkingComparison we evaluate CTL properties dealing with marking comparisononly
CTLPlaceComparison we evaluate CTL properties dealing with the comparison ofplaces marking only
CTLMix we evaluate CTL properties dealing with all the previous type ofatomic proposition
LTLCardinalityComparison we evaluate LTL properties dealing with checking cardinality ofmarking only
LTLFireability we evaluate LTL properties dealing with transition fireability only
LTLMarkingComparison we evaluate LTL properties dealing with marking comparisononly
LTLPlaceComparison we evaluate LTL properties dealing with the comparison ofplaces marking only
LTLMix we evaluate LTL properties dealing with all the previous type ofatomic proposition
ReachabilityDeadlock we evaluate reachability properties dealing with transition dead-locks only
ReachabilityCardinalityComparison we evaluate reachability properties dealing with checking cardi-nality of marking only
ReachabilityFireability we evaluate reachability properties dealing with transition fire-ability only
ReachabilityMarkingComparison we evaluate reachability properties dealing with marking com-parison only
ReachabilityPlaceComparison we evaluate reachability properties dealing with the comparisonof places marking only
ReachabilityMix we evaluate reachability properties dealing with all the previoustype of atomic proposition
Table 4.
List of the examinations proposed at the
MCC’2013 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. The main execution loop is very simple. It is presented in Algorithm 1. For each model/instanceand for each examination, we perform a test and extract data from the B ench K it monitor (CPU andmemory consumption, if time confinement was reached or not) and from the tool (stdout, result had tobe formatted in dedicated lines). Input : M , a set of scalable models to be processed foreach m ∈ M and v ∈ Scaling Par ameter s ( M ) do launch the virtual machine for m / v report information to the databasehalt the virtual machine Algorithm 1:
Actions performed for each tool by the invocation scriptThe main difficulty, handled by B ench K it was to dispatch the executions over the set of involved ma-chines. To keep consistency of the executions and make these comparable, all the examinations relatedto a given model m ware operated on the same host. Three computers were made available to operate the submitted tools by various institutions: clus-ter1 , ebro and quadhexa-2. Their characteristics are reported in table 5.Memory confinement was 4Gbyte of memory and 45mn of CPU for all examinations. cluster1 (Univ P. & M. Curie) ebro (Univ. Rostock) quadhexa-2 (Univ. Nanterre)Characteristics of the CPU total of 46 CPU total of 64 CPU total of 24 CPU23 × Intel Xeon E5645 4 × AMD Opteron 6200 Series 4 × Intel Xeon X74602.4 GHz, 6-Core, 2.7 GHz, 16-Core, 2.66 GHz, 6-Core,6 × × × Memory × × × × Disks × × × × Linux Kernel
Table 5.
Characteristics of the machines used for the
MCC’2013 For cluster1, only 18 of the 23 available nodes where allocated due to parallel experimentations. eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. The organizers thank the Universities of Paris-Ouest-Nanterre , Rostock and Pierre & MarieCurie for letting us using their computers. Table 6 provides a summary concerning the executions over the proposed benchmark, for both the“Known” and the “Surprise” models. Please note that the number of execution does not includes a largenumber of preliminary tests in cooperation with the tool developers? “Known” Models “Surprise” ModelsTotal Number of tool executions
49 380 4 913
Execution per Machine cluster1: 24 937 ebro: 1 640quadhexa-2: 24 443 quadhexa-2: 3 273
Total CPU Time required
80 days, 18 hours, 17 minutes, 11 seconds 3 days, 11 hours, 45 minutes, 12 seconds
Size of collected raw data (CSV, outputs, etc. excluding charts)
Produced Performance Charts (for models)
Produced Execution Charts (for relevant executions)
13 763 1 541
Table 6.
Characteristics of the machines used for the
MCC’2013
This section reports the open issues identified during the discussion following the presentation ofresults on June 25th, 2013 in Milano. We differentiate organizational matters from technical issues.
Organizational Matters are listed below:Io1 Live Event: this event, lately announced, had to be canceled, which is a pity. Its objective is to providefeedback on tools from a "usability" point of view (look and feel, quality of documentation andtutorials, etc). We will announce it earlier for the next edition in 2014.Io2 People: so far, active people in the model checking contest are to few...Io3 Global schedule: the submission deadline should be pushed earlier to allow more time for analysisof the tools.Io4 "known" and "surprise" models: A strong suggestion is, after the call for model, to decide that allnew models will be "surprise" and thus not submitted after the call for models. Models of previousyears will then be the only "known" models. This should ease the management of the MCC and helpto relax the agenda and have the call for tools submission out earlier.Io5 Rules: some people suggest to clean up the rules in order to make clear what is possible and what isnot allowed. In particular, all precomputed aspects should be carefully investigatedIo6 Trophies: we all agreed on the fact that the formulas used this year are mainly temporary. This for-mula should be discussed and should introduce more aspects on the results like, time and memoryconsumption, how correct the outputs are (only for the state space examination this year), supportof P/T and/or colored models, etc.
Technical issues are listed below: eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. It1 Generation of formulas: this is an issue for the second year and it was not yet solved. The problemis to select a large number of formulas for which we can state their result: satisfied or unsatisfied.Considering the number of models and instances of these models (a total of 255 in 2013), thesemush be generated automaticallyIt seems that SPOT [20] could provide a basis of solution for LTL formulas. In particular, it offers amechanism to generate random formulas and to select them according to numerous criteria ( e.g. size of the related Büchi automata) [19].During the discussion, several other possible solutions. One is the definition of formula patternsthat could be repeated and arranged randomly and combined together with atomic propositions.Another possibility is to propose manually sort of "parameterized" formulas that are scaled up foreach instances, however, if this requires less formulas, there are yet numerous formulas to provide.The participants agree on the fact that purely random formulas are not good but it is necessary togenerate formulas automatically in "a good way". We can insert existing formulas when they areavailable (this was done for the surprise model "Vasy2003"). Another important point is that theoutput values of formula should be known in advance so that: 1) their veracity could be checked,and 2) there can be the same amount of satisfied and unsatisfied formulas to be processes (maybeseparately).There is however a real problem due to issue Io2; manpower is quite low and must be extended tolet time for these tasks.It2 Grammar for formula: It could be made less ambiguous (e.g. fully braketed expressions). Some peo-ple reported difficulties of interpretation and then translation. The idea is to have a small task forcethat will bring out proposals, especially for the atomic propositions. Somebody suggested to usePNML identifiers of objects instead of their labels (but this may cause problems with the equiva-lences between colored nets and P/T ones).It3 BenchKit (resolved at this stage ): if this benchmarking tool appear to be operational (it was suc-cessfully used to operate the 54293 executions required this year), its usage remains difficult for thenon-developers. A new version should appear, making its "individual use" easier, thus allowing thecommunity to reuse outputs from this contest and later ones.It4 High-level colored nets: a solution should be proposed to have high-level colored nets (the problemin 2012 and 2013 was how to produce their PNML representation). This would allow some toolsusing such models to be "more on their playground" than with lower level Petri nets. A new release of B ench K it is available at http://benchkit.cosyverif.org . eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. This documen reported our experience with the
Model Checking Contest 2013 (third edition).From the tool developers’ point of view, such an event allows to compare tools on a common bench-mark that could become a public repository. Also, some mechanisms established for the contest, suchas a language to elaborate the formula to be verified could become, over the years, a common way toprovide formulæ to the various tools developed by the community.If the results for the state space generation are clear and can be interpreted, we still faced, as lastyear, some troubles with formulæ. The main problem is the quite complex execution chain and, moreparticularly, the translation from the provided formula language to the one of the tool. Since formulæwere generated automatically (and distinct for each instance of a given model) it was impossible topredict their result and, most often, no consensus was found between the participating tools.For that reason, we only consider the fact that at least one value could be completed by a given toolfor these examinations (this is mentioned in the corresponding sections).Let us note that both the benchmarks and the tool submissions are available on the
MCC’2013 ’sweb site ( http://mcc.lip6.fr/2013 ). Experiments can thus be reproduced thanks to the B ench K it confined run environment [31] available at http://benchkit.cosyverif.org . Acknowledgements
The
Model Checking Contest @ Petri nets organizers would like to thank the fol-lowing people for the help they provided in setting up this event: Fabrice Legon-Aubry and Harro Wim-mel (multi-core machine management), and Lom Hillah (definition of properties).The
Model Checking Contest organizers would also like to thank the following institutions that borroweda powerful multi-core or cluster machine for the numerous execution required for the
MCC’2013 : Uni-versité Pierre & Marie Curie, Université Paris Ouest Nanterre and Universität Rostock.The
Model Checking Contest organizers would finally like to thank the tool developers who made pos-sible such a contest. They are: – AlPiNA : Steve Hostettler, Alexis Marechal, and Edmundo Lopez; – Cunf : César Rodríguez; – GreatSPN : Elvio Amparore and Marco Beccuti; – ITS − Tools : Yann Thierry-Mieg, Maximilien Colange et. al.; – LoLA (all variants): Niels Lohmann and Karsten Wolf; – Marcie : Alexey Tovchigrechko, Martin Schwarick, and Christian Rohr; – Neco : Lukasz Fronc; – PNXDD : Silien Hong and Emmanuel Paviot-Adet; – Sara : Harro Wimmel and Karsten Wolf. 22 art II
State Space Generation eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
This examination deals with state space generation only. We first show a summary on the handlingof models by the participating tools. Then, we present the computed outputs and the associated scoresfor this examination prior to a summary of relevant executions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for StateSpace : memory / / , : s e c ond s CSRepetitions (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for StateSpace : memory / / , : s e c ond s CSRepetitions (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for StateSpace : memory / / , : s e c ond s Dekker (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for StateSpace : memory / / , : s e c ond s DotAndBoxes (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for StateSpace : memory / / , : s e c ond s DrinkVendingMachine (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for StateSpace : memory / / , : s e c ond s DrinkVendingMachine (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
No instance of this model could be computed for the
StateSpace examination.
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 26 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Eratosthenes (P/T) for StateSpace : memory / / , : s e c ond s Eratosthenes (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for StateSpace : memory / / , : s e c ond s FMS (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (Colored) for StateSpace : memory / / , : s e c ond s GlobalRessAlloc (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 27 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (P/T) for StateSpace : memory / / , : s e c ond s GlobalRessAlloc (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for StateSpace : memory / / , : s e c ond s Kanban (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (Colored) for StateSpace : memory / / , : s e c ond s LamportFastMutEx (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 28 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (P/T) for StateSpace : memory / / , : s e c ond s LamportFastMutEx (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for StateSpace : memory / / , : s e c ond s MAPK (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s NeoElection (Colored) for StateSpace : memory / / , : s e c ond s NeoElection (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 29 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (P/T) for StateSpace : memory / / , : s e c ond s NeoElection (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for StateSpace : memory / / , : s e c ond s PermAdmissibility (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for StateSpace : memory / / , : s e c ond s PermAdmissibility (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 30 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Peterson (Colored) for StateSpace : memory / / , : s e c ond s Peterson (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for StateSpace : memory / / , : s e c ond s Peterson (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s Philosophers (Colored) for StateSpace : memory / / , : s e c ond s Philosophers (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 31 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Philosophers (P/T) for StateSpace : memory / / , : s e c ond s Philosophers (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PhilosophersDyn (Colored) for StateSpace : memory / / , : s e c ond s PhilosophersDyn (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for StateSpace : memory / / , : s e c ond s PhilosophersDyn (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
StateSpace examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 32 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Railroad (P/T) for StateSpace : memory / / , : s e c ond s Railroad (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for StateSpace : memory / / , : s e c ond s RessAllocation (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for StateSpace : memory / / , : s e c ond s Ring (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 33 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s RwMutex (P/T) for StateSpace : memory / / , : s e c ond s RwMutex (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (Colored) for StateSpace : memory / / , : s e c ond s SharedMemory (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for StateSpace : memory / / , : s e c ond s SharedMemory (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 34 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SimpleLoadBal (Colored) for StateSpace : memory / / , : s e c ond s SimpleLoadBal (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for StateSpace : memory / / , : s e c ond s SimpleLoadBal (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s TokenRing (Colored) for StateSpace : memory / / , : s e c ond s TokenRing (Colored) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 35 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s TokenRing (P/T) for StateSpace : memory / / , : s e c ond s TokenRing (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for StateSpace : memory / / , : s e c ond s HouseConstruction (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for StateSpace : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
StateSpace ex-amination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). 36 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s QuasiCertifProtocol (P/T) for StateSpace : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for StateSpace : memory / / , : s e c ond s Vasy2003 (P/T) for StateSpace : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).Please note that, for some models/instances, we could not reformat the number of the state space(apparently over 10 states) and then provide “ ∞ (ovf)” as an answer. “Known” Models Results are summarized in the table below.
CSRepetitions (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc03 × nc × nc nc nc nc04 to nc mp nc nc nc nc05 to nc mp nc nc nc nc07 cc nc mp nc nc nc nc10 cc nc mp nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. CSRepetitions (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc × × × nc × × × to × × nc to cc × to to × nc to nc × cc mp × nc to nc to cc mp mp nc to nc to Dekker (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD to nc nc to nc nc to nc mp nc × × × cc nc mp nc to cc nc100 cc nc mp nc to nc to to nc mp nc to nc to DotAndBoxes (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc3 cc nc nc nc nc nc4 cc nc nc nc nc nc5 cc nc mp nc nc nc nc DrinkVendingMachine (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc10 cc nc × nc nc nc nc DrinkVendingMachine (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc cc nc to nc × nc to Echo (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD d02r09 cc nc mp nc to nc to d02r11 cc nc mp nc to nc to d02r15 cc nc mp nc to nc to d02r19 cc nc mp nc to nc to d03r03 to nc mp nc to nc mp d03r05 cc nc mp nc to nc mp d03r07 cc nc mp nc to nc to d04r03 cc nc mp nc to nc mp d05r03 cc nc mp nc to nc to Eratosthenes (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc
32 32 32 nc nc × nc × nc × cc × × nc × nc × nc × cc nc × nc × nc × cc nc × nc × nc × FMS (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc × × × nc × × × to × × nc × cc × to × × nc × cc × to × × nc × nc × to × × nc × nc to to to × nc to nc to to to to nc to nc to GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD to nc nc nc nc nc05 to nc × nc nc nc nc06 to nc × nc nc nc nc07 to nc mp nc nc nc nc09 to nc mp nc nc nc nc10 to nc mp nc nc nc nc11 to nc mp nc nc nc nc GlobalRessAlloc (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD to 6320 6320 nc nc to cc to nc to nc to Kanban (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD × × × nc × × × × × × nc × cc × to × × nc × cc × to × × nc × nc to to × × nc × nc to to cc × nc to nc to to cc to nc to nc to to to to nc to nc to LamportFastMutEx (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc3 nc nc nc nc nc4 to nc × nc nc nc nc5 to nc × nc nc nc nc6 to nc mp nc nc nc nc7 to nc mp nc nc nc nc8 to nc mp nc nc nc nc LamportFastMutEx (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc
380 380 380 nc nc to nc × nc × × × to nc × nc to cc × to nc mp nc to cc mp to nc mp nc to to mp to nc mp nc to to mp MAPK (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD to × × nc × × × to × × nc × cc × to × × nc × nc × to to × nc × nc to to to to nc to nc to to to mp nc to nc to NeoElection (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc3 nc nc nc nc nc4 to nc × nc nc nc nc5 to nc mp nc nc nc nc6 to nc mp nc nc nc nc7 to nc mp nc nc nc nc8 to nc mp nc nc nc nc NeoElection (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc
241 241 241 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. nc nc nc to nc × nc to nc × to nc mp nc to nc nc6 to nc mp nc to nc to to nc to nc to nc to to nc to nc to nc to PermAdmissibility (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc02 to nc mp nc nc nc nc05 to nc mp nc nc nc nc10 to nc mp nc nc nc nc20 to nc mp nc nc nc nc50 to nc mp nc nc nc nc PermAdmissibility (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc to cc mp nc to nc to to cc mp nc to nc to to cc mp nc to nc mp to cc mp nc to nc mp to cc mp nc to nc mp Peterson (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc3 × nc × nc nc nc nc4 to nc mp nc nc nc nc5 cc nc mp nc nc nc nc6 cc nc mp nc nc nc nc7 cc nc mp nc nc nc nc Peterson (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc × nc × nc × to × to nc × nc to cc × cc nc × nc to nc nc6 cc nc mp nc to nc nc7 cc nc mp nc to nc nc Philosophers (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc000010 nc nc nc nc nc000020 × nc × nc nc nc nc000050 × nc × nc nc nc nc000100 × nc × nc nc nc nc000200 cc nc × nc nc nc nc000500 cc nc × nc nc nc nc001000 cc nc ∞ (ovf) nc nc nc nc002000 cc nc ∞ (ovf) nc nc nc nc005000 cc nc ∞ (ovf) nc nc nc nc010000 cc nc ∞ (ovf) nc nc nc nc050000 cc nc ∞ (ovf) nc nc nc nc100000 cc nc ∞ (ovf) nc nc nc nc Philosophers (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
243 243 243 nc
243 243 243 nc × × × nc × cc × × × × nc × nc × × × × nc × nc × eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc × × nc × nc × cc to × nc × nc × cc mp ∞ (ovf) nc ∞ (ovf) nc ∞ (ovf) cc mp ∞ (ovf) nc ∞ (ovf) nc ∞ (ovf) cc mp ∞ (ovf) nc to nc to cc cc ∞ (ovf) nc to nc to PhilosophersDyn (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc nc10 cc nc nc nc nc nc nc20 to nc nc nc nc nc nc50 to nc nc nc nc nc nc80 to nc nc nc nc nc nc PhilosophersDyn (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
325 7251 7251 nc cc 199051 mp nc to cc 199051 to mp mp nc to nc to Planning (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD cc nc nc nc cc nc nc nc Railroad (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc to nc × nc × × × to nc mp nc to cc nc050 cc nc mp nc to nc nc100 cc nc to nc to nc to RessAllocation (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
R002C002 nc nc R003C002 nc nc
20 20 20
R003C003 nc nc
92 92 92
R003C005 nc nc R003C010 to nc nc R003C015 to nc × nc × cc × R003C020 to nc × nc × cc × R003C050 to nc × nc × to × R003C100 cc nc × nc × to × R005C002 nc nc
112 112 112
R010C002 nc nc R015C002 to nc nc R020C002 to nc mp nc × × × R050C002 to nc mp nc × cc × R100C002 to nc mp nc × to × Ring (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD none to nc × nc × nc × RwMutex (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD r0010w0010 nc nc r0010w0020 nc nc r0010w0050 nc nc r0010w0100 nc nc r0010w0500 cc nc nc r0010w1000 cc nc nc r0010w2000 cc nc nc to cc to r0020w0010 to nc mp nc r0100w0010 to nc mp nc cc to ncr0500w0010 cc nc mp nc cc cc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 cc nc mp nc cc cc ncr2000w0010 cc nc to nc cc cc to SharedMemory (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc000010 × nc × nc nc nc nc000020 cc nc × nc nc nc nc000050 cc nc × nc nc nc nc000100 cc nc × nc nc nc nc000200 to nc × nc nc nc nc000500 cc nc × nc nc nc nc001000 cc nc ∞ (ovf) nc nc nc nc002000 cc nc ∞ (ovf) nc nc nc nc005000 cc nc ∞ (ovf) nc nc nc nc010000 cc nc ∞ (ovf) nc nc nc nc020000 cc nc ∞ (ovf) nc nc nc nc050000 cc nc ∞ (ovf) nc nc nc nc100000 cc nc ∞ (ovf) nc nc nc nc SharedMemory (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc × × × nc × × × cc mp × nc × cc × cc mp × nc to nc to cc mp × nc to nc to to cc × nc to nc to SimpleLoadBal (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc05 nc nc nc nc nc10 cc nc × nc nc nc nc15 cc nc mp nc nc nc nc20 cc nc mp nc nc nc nc SimpleLoadBal (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc
832 832 832 nc nc cc nc nc nc × cc × cc nc nc nc to cc × cc nc nc nc to cc × TokenRing (colored)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD nc nc nc nc nc nc010 cc nc nc nc nc nc nc020 cc nc nc nc nc nc nc050 cc nc nc nc nc nc nc100 cc nc nc nc nc nc nc200 to nc nc nc nc nc nc500 cc nc nc nc nc nc nc TokenRing (P/T)
Instances
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
65 166 166 nc
166 166 166 cc 58905 58905 nc cc mp nc nc to nc × cc cc nc nc to nc to “Surprise” Models Results are summarized in the table below.
HouseConstruction (P/T) instances
AlPiNA ITS − Tools Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. to × × cc × to × × cc to to mp cc cc to to mp cc cc to to mp cc cc to to to to cc to IBMB2S565S3960 (P/T) instances
AlPiNA ITS − Tools Marcie Neco PNXDD none to cc × to × QuasiCertifProtocol (colored) instances
AlPiNA ITS − Tools Marcie Neco PNXDD cc nc nc nc nc06 cc nc nc nc nc10 cc nc nc nc nc18 cc nc nc nc nc22 cc nc nc nc nc28 cc nc nc nc nc32 cc nc nc nc nc QuasiCertifProtocol (P/T) instances
AlPiNA ITS − Tools Marcie Neco PNXDD to × × to × to mp to to to cc mp to cc nc22 cc mp cc cc nc28 cc mp cc cc nc32 cc mp cc cc nc Vasy2003 (P/T) instances
AlPiNA ITS − Tools Marcie Neco PNXDD none cc mp × cc to Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
Total Score
103 47 234 0 129 64 139CSRepetitions (Colored)
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. CSRepetitions (P/T)
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 0 2 0 0 0 0subtotal AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 2 0 2 2 2subtotal AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD
AlPiNA GreatSPN ITS − Tools LoLa pess Marcie Neco PNXDD eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
AlPiNA ITS − Tools Marcie Neco PNXDD
Total Score
AlPiNA ITS − Tools Marcie Neco PNXDD
AlPiNA ITS − Tools Marcie Neco PNXDD
AlPiNA ITS − Tools Marcie Neco PNXDD
AlPiNA ITS − Tools Marcie Neco PNXDD
AlPiNA ITS − Tools Marcie Neco PNXDD
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. ITS − Tools PNXDD Marcie
234 points 139 points 129 points
For “Surprise” Models
Marcie PNXDD ITS − Tools
24 points 15 points 12 points
Global
ITS − Tools Marcie PNXDD
258 points 177 points 169 points 49 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. art III Reachability Analysis eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
This examination deals with reachability properties dealing with checking cardinality of markingonly. We first show a summary on the handling of models by the participating tools. Then, we presentthe computed outputs and the associated scores for this examination prior to a summary of relevantexecutions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s CSRepetitions (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Dekker (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s DotAndBoxes (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s DrinkVendingMachine (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 54 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Echo (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Echo (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Eratosthenes (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s FMS (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 55 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s GlobalRessAlloc (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Kanban (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 56 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s LamportFastMutEx (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s MAPK (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 57 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s NeoElection (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s PermAdmissibility (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 58 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s PermAdmissibility (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Peterson (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Peterson (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityCardinal-ityComparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 59 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Philosophers (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityCar-dinalityComparison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityCardinality-Comparison examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Railroad (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 60 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s RessAllocation (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s RessAllocation (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Ring (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s RwMutex (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityCardi-nalityComparison examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 61 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SharedMemory (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (Colored) for ReachabilityCardinalityComparison : memory / / , : s e c ond s SimpleLoadBal (Colored) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityCardinality-Comparison examination.
TokenRing (P/T)
No instance of this model could be computed for the
ReachabilityCardinality-Comparison examination. 62 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s HouseConstruction (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachability-CardinalityComparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for ReachabilityCardinalityComparison : memory / / , : s e c ond s Vasy2003 (P/T) for ReachabilityCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFTF nc nc nc nc nc nc03 nc
FTFTFFFF nc nc nc nc nc nc04 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc CSRepetitions (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFTF nc TFTFFTFT TFTFFTFT -F-FF-F- TFTFFTFT FFFFFFFT cc FTFTFFFF nc TFTFFFFT TFTFFFFT -F-FFFF- TFTFFTFT FFFFTFFF cc FFFFTFTF nc -F-FF-FF -F-FF-FF -F-FF-FF to to cc to nc –-F-FFF –-F-FFF –-F-FFF to to cc mp nc cc cc cc cc to cc mp nc cc cc cc cc to cc Dekker (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc nc
TFTFTTFF TFTFTTFF -F-F–FF TFTFTTFF FFFFFFFF cc
015 nc nc
TTTFFFFF TTTFFFFF –-FFFFF to FFFTTFFF cc
020 nc nc to to FFFFF-F- to FFFFTFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
050 nc nc -F-FFFFF -F-FFFFF -F-FFFFF to to cc
100 nc nc -FFFFFFF -FFFFFFF -FFFFFFF to to cc
200 nc nc to to to to to cc
DotAndBoxes (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFTF nc nc nc nc nc nc3 nc
FFFFFFTF nc nc nc nc nc nc4 nc cc nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc DrinkVendingMachine (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc10 nc cc nc nc nc nc nc nc DrinkVendingMachine (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFFFFFF FFFTFFFF cc
10 nc nc cc cc cc cc FFFTFFFF cc
Echo (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc nc -F-FFFFF -F-FFFFF to to to cc d02r11 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFF-F- to cc d02r15 nc nc –-F-FFF –-F-FFF to to to cc d02r19 nc nc -F-FFFFF -F-FFFFF to -F-FFFFF to ––-TTT d03r03 nc nc ––-FFF ––-FFF to to to cc d03r05 nc nc -F-FF-FF -F-FF-FF to to to cc d03r07 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to ––-TT- d04r03 nc nc -F-F–F- -F-F–F- to to to cc d05r03 nc nc -F-FFFFF -F-FFFFF to to to ––-TTT
Eratosthenes (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FFFFFFFF TFTFFFFF TFTFFFFF -F-FFFFF TFTF-TFT FFFFTFFF cc
020 nc
FFFFFFFF FFFFFTFF FFFFFTFF FFFFF-FF FF-FFTFT FFFTFFFF –––-T
050 nc
FFFF FFFFFFFF FFFFFFFF FFFFFFFF FF-F-FFF FFFTFFFF cc
100 nc
FFFF to to to -F-FF–- FFFFFFFF cc
200 nc
FFFFFFFF FFFFF-F- FFFFF-F- to to FFFFTFFF cc
500 nc
FFFF -FFFFFFF -FFFFFFF to to FFFTTFFF cc
FMS (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFTF nc FFFFFTTT FFFFFTTT FFFFF–- -F-FF–- FFFTTFFF cc
FFFFFFFF nc TFFFTTFT TFFFTTFT -FFF–F- –FF-TF- FFTTFFFF cc
FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF –––F- FFFFFFFF cc
FFFFFFFF nc -F-FFFFF -F-FFFFF -F-FFFFF -F-FF-F- FFFFFFFF cc FFFFFFFF nc –-F-FFF –-F-FFF –-F-FFF –-F-FFF FFFTFFFF ––-TTT F cc -F-FFFFF -F-FFFFF -F-FFFFF -F-FFFFF FFFFFFFF cc to nc -F-FFFFF -F-FFFFF -F-FFFFF -F-FF-F- to cc to nc –-FFFFF –-FFFFF –-FFFFF –-FFFFF to cc GlobalRessAlloc (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc
FFFFFFTF nc nc nc nc nc nc05 nc
FFFFFFFF nc nc nc nc nc nc06 nc
FFFFFFFF nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc09 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc11 nc mp nc nc nc nc nc nc GlobalRessAlloc (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFTF nc FFTFFTFT FFTFFTFT FF-FF-F- to FFFTTFFF cc cc nc to to to cc to cc Kanban (P/T) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc TFTFFTFT TFTFFTFT -F-FF-F- -F-FF-F- FFFTTFFF cc
FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF –-F–F- FFFTFFFF –––-T
FFFFFFFF nc -F-FFFFF -F-FFFFF to -F-FFFF- FFFFFFFF cc to nc -F-FFFFF -F-FFFFF -F-FFFFF –-FFFFF FFFTTFFF cc FFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFF–- FFFTTFFF ––-TTT mp nc FFFFF-FF FFFFF-FF FFFFF-FF FFFFF-FF to cc mp nc –FF–F- –FF–F- –FF–F- –FF–F- to cc to nc -F-F-FFF -F-F-FFF -F-F-FFF –––-F to ––-TT- LamportFastMutEx (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFTF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc
FFFFFFFF nc nc nc nc nc nc5 nc
FFFFFFFF nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc LamportFastMutEx (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFTTFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc TTTFTFFF TTTFTFFF –-F-FFF –-F–F- FFFTFFFF cc
FFFFFFFF nc -FFFFFFF -FFFFFFF -FFFFFFF –-FFFFF FFFTTFFF cc to nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FFFFF FFFFTFFF cc to nc -F-FFFFF -F-FFFFF -F-FFFFF to FFFFFFFF cc to nc -F-FFFFF -F-FFFFF -F-FFFFF to to ––-FF- to nc –FF-FFF –FF-FFF –FF-FFF to to –––-T NeoElection (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc cc nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc NeoElection (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFTTFFFF cc
TFFFT–- TFFFT–- -FFF–– cc FFFTFFFF cc ––-FF- ––-FF- to to to cc ––-FFF ––-FFF ––-FFF ––-FFF to cc to to to to to cc cc cc cc cc to cc to to to to to to
PermAdmissibility (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc
FTFTFFFF nc nc nc nc nc nc02 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
50 nc mp nc nc nc nc nc nc PermAdmissibility (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTFFF cc FTFTTFTF nc -F-FFFF- -F-FFFF- to to to cc TTTTFFFF nc FFFFF-F- FFFFF-F- to to to cc FFFFTFFF nc to to to to to cc FTFTFFTF nc -F-F–F- -F-F–F- to to cc cc TTTTTFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to cc
Peterson (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc mp nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc Peterson (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TFTFFFFF TFTFFFFF -F-FFFFF -F-F-FFF FFFTTFFF cc
TFTFF–- TFTFF–- -F-FF–- -F-F–– FFFFFFFF cc –-FF–- –-FF–- to to to cc -F-FF–- -F-FF–- to to to cc cc cc cc cc to cc
FFFFF–- FFFFF–- FFFFF–- FFFFF–- to cc
Philosophers (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nf TFTFFFFF TFTFFFFF -F-FFFFF –-F-FFF FFFTFFFF cc
FFFFTFFF nf TTFFFFFF TTFFFFFF –FFFFFF TTFFFFFF FFTTTFFF cc
FFFFFFFF nf -F-FFFFF -F-FFFFF -F-FFFFF to FFFTFFFF cc to nf cc cc cc cc FFFTTFFF cc mp nf cc cc cc cc FFFTFFFF cc mp nf cc cc cc cc FFFTFFFF cc to nf cc cc cc cc FFFFFFFF cc mp nf cc cc cc cc FFFTTFFF cc mp nf mp mp mp mp to mp mp nf to to to to to to cc nf to to to to to to PhilosophersDyn (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. PhilosophersDyn (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TTTFTFFF TTTFTFFF –-F-FFF TTTFTFFF FFFTFFFF cc mp nc TTTTFTFT TTTTFTFT ––F-F- TTTTFTFT to cc mp nc to to to to to cc Planning (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc
TTTFFTFT TTTFFTFT –-FF-F- TTTFFTFT FFFTTFFF cc
010 nc nc
FFFFFTTT FFFFFTTT FFFFF–- FFFF–– FFFFFFFF cc
020 nc nc -FFFFFFF -FFFFFFF -FFFFFFF to to cc
050 nc nc to to to to to cc
100 nc nc to to to to to cc
RessAllocation (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc nc
TFFFFTFF TFFFFTFF -FFFF-FF –FFF-F- FFFTTFFF –––-T
R003C002 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFFFFF- FFFTTFFF cc
R003C003 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFF-F- FFFTFFFF cc
R003C005 nc nc
FFFFFTFF FFFFFTFF FFFFF-FF -F-FFTFF FFFFFFFT cc
R003C010 nc nc
TTTFTFFF TTTFTFFF –-F-FFF –TF–FF FFFTFFFF cc
R003C015 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF cc
R003C020 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF ––-TTT
R003C050 nc nc -F-FFFFF -F-FFFFF to to FFFFFFFF cc
R003C100 nc nc -FFFFFFF -FFFFFFF to to FFFTTFFF cc
R005C002 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF –––-T
R010C002 nc nc
TTTTTTFT TTTTTTFT –––F- TTTT-TFT FFFFFFFF cc
R015C002 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTFFF –––-T
R020C002 nc nc
TFTFFTTT TFTFFTTT -F-FF–- TFTFFTTT FFFFFFFF cc
R050C002 nc nc
T-T-FFFF T-T-FFFF to to FFFFTFFF cc
R100C002 nc nc -F-FFFFF -F-FFFFF -F-FFFFF -F-FFFFF FFFFFFFF cc
Ring (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc nc
FFFFF-F- FFFFF-F- FFFFF-F- to FFFFFFFF cc
RwMutex (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFF–- FFFFFFFF cc r0010w0020 nc nc
TFTFTTFF TFTFTTFF -F-F–FF TFTFT–- FFFFFFFF cc r0010w0050 nc nc
TFTFFTFF TFTFFTFF -F-FF-FF ––-TFF FFFFFFFF cc r0010w0100 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF cc FFFTFFFF cc r0010w0500 nc nc
TFFFFTFF TFFFFTFF -FFFF-FF TF–-TFF FFFTTFFF cc r0010w1000 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFTFFFF cc r0010w2000 nc nc
TFTFTTFF TFTFTTFF -F-F–FF to to ––-TT- r0020w0010 nc nc
TTTTFFFF TTTTFFFF ––FFFF ––F-F- to cc r0100w0010 nc nc
TTTFTFFF TTTFTFFF –-F-FFF to cc cc r0500w0010 nc nc
TTTFTTFF TTTFTTFF –-F–FF –-F–F- cc cc r1000w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF -F-F–F- cc cc r2000w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to cc cc
SharedMemory (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc nc nc nc nc nc nc000010 nc cc nc nc nc nc nc nc000020 nc cc nc nc nc nc nc nc000050 nc cc nc nc nc nc nc nc000100 nc cc nc nc nc nc nc nc000200 nc cc nc nc nc nc nc nc000500 nc cc nc nc nc nc nc nc001000 nc cc nc nc nc nc nc nc002000 nc cc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc nc nc nc nc nc nc010000 nc cc nc nc nc nc nc nc020000 nc cc nc nc nc nc nc nc050000 nc cc nc nc nc nc nc nc100000 nc cc nc nc nc nc nc nc SharedMemory (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFFFFFT cc TTTFFTTF TTTFFTTF –-FF–F –-FF–F FFFTTFFT cc
FTFTFFFF cc TTTTTFFT TTTTTFFT ––-FF- to FFFFFFFF cc mp cc -FFFFFFF -FFFFFFF -FFFFFFF to FFFTTFFF cc mp cc cc cc cc cc to cc mp cc cc cc cc cc to cc cc cc cc cc cc cc to cc
SimpleLoadBal (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc05 nc
FTFTTFFF nc nc nc nc nc nc10 nc
FFFFFFFF nc nc nc nc nc nc15 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc SimpleLoadBal (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TFFFFTFT TFFFFTFT -FFFF-F- -FFF-TFT FFFTTFFF cc
05 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF -F-FFFFF FFFFFFFF cc
10 nc nc to to to to FFFFFFFF cc
15 nc nc to to to to to cc
20 nc nc to to to to to cc
TokenRing (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf nf
TokenRing (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFF- FFFFFFFT cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FF–-FFF FF–-FFF FF–-FFF to FFFFFFFF F––TT-
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
42 58 174 174 148 106 122 34CSRepetitions (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. DotAndBoxes (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 2 2 2 2 0 2best 0 0 2 2 2 2 0 2subtotal GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 0 10 10 7 7 2 0Peterson (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 2 2 2 0 2 0subtotal GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 12 6 24 6HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models
LoLA LoLa opt LoLa opt inc
174 points 174 points 148 points
For “Surprise” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Marcie LoLA LoLa opt LoLa opt inc
24 points 12 points 12 points 12 points
Global
LoLA LoLa opt LoLa opt inc
198 points 198 points 172 points 76 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
This examination deals with reachability properties dealing with transition deadlocks only. We firstshow a summary on the handling of models by the participating tools. Then, we present the computedoutputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s CSRepetitions (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Dekker (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s DotAndBoxes (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s DrinkVendingMachine (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 78 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Echo (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Echo (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Eratosthenes (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s FMS (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 79 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s GlobalRessAlloc (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Kanban (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 80 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s LamportFastMutEx (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s MAPK (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 81 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s NeoElection (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s PermAdmissibility (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 82 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s PermAdmissibility (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s Peterson (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Peterson (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityDeadlock examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 83 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Philosophers (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityDead-lock examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityDeadlock exami-nation.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Railroad (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 84 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s RessAllocation (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s RessAllocation (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Ring (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s RwMutex (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityDead-lock examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 85 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SharedMemory (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (Colored) for ReachabilityDeadlock : memory / / , : s e c ond s SimpleLoadBal (Colored) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityDeadlock examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 86 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s TokenRing (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s TokenRing (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s HouseConstruction (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachability-Deadlock examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). 87 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s QuasiCertifProtocol (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for ReachabilityDeadlock : memory / / , : s e c ond s Vasy2003 (P/T) for ReachabilityDeadlock : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc F nc nc nc nc nc nc03 nc nc F nc nc nc nc nc nc04 nc nc mp nc nc nc nc nc nc05 nc nc mp nc nc nc nc nc nc07 nc nc mp nc nc nc nc nc nc10 nc nc mp nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. CSRepetitions (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FF FF nc FF FF FF FF FT F- F? FF nc FF FF FF FF FT F- to FF nc FF FF FF FF to F- to to nc FF FF FF FF to F- to mp nc FF FF FF FF to F- to mp nc FF FF FF FF to F-
Dekker (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- to FT F- FT nc nc to to to to to F- FT nc nc to to to to to F-
200 nc nc nc to nc to to to F- DotAndBoxes (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara F nc nc nc nc nc nc3 nc nc F nc nc nc nc nc nc4 nc nc F nc nc nc nc nc nc5 nc nc mp nc nc nc nc nc nc DrinkVendingMachine (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc F nc nc nc nc nc nc10 nc nc F nc nc nc nc nc nc DrinkVendingMachine (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F-
10 nc nc nc
F- F- F- F- FT F-
Echo (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc nc nc
FF FF FF FF to F- d02r11 nc nc nc
FF FF FF FF to F- d02r15 nc nc nc
FF FF FF FF to F- d02r19 nc nc nc
FF FF FF FF to F- d03r03 nc nc nc
FF FF FF FF to F- d03r05 nc nc nc
FF FF FF FF to F- d03r07 nc nc nc
FF FF FF FF to F- d04r03 nc nc nc
FF FF FF FF to F- d05r03 nc nc nc
FF FF FF FF to F-
Eratosthenes (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FF nc nc FF FF FF FF FT F- FF nc nc FF FF FF FF FT F- FF nc nc FF FF FF FF FT F- FF nc nc FF FF FF FF FT F- FF nc nc FF FF FF FF FT F-
500 nc nc nc
FF FF FF to FT F-
FMS (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
002 nc FT nc FT FT F- FT FT F-
005 nc FT nc FT FT F- FT FT F-
010 nc FT nc FT FT F- FT FT F-
020 nc FT nc FT FT F- FT FT F-
050 nc FT nc FT FT F- FT FT F-
100 nc FT nc FT FT F- FT FT F-
200 nc to nc FT FT F- FT to F-
500 nc to nc FT FT F- FT to F-
GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc F nc nc nc nc nc nc05 nc nc F nc nc nc nc nc nc06 nc nc F nc nc nc nc nc nc07 nc nc mp nc nc nc nc nc nc09 nc nc mp nc nc nc nc nc nc10 nc nc mp nc nc nc nc nc nc11 nc nc mp nc nc nc nc nc nc GlobalRessAlloc (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara F? FT nc FT FT F- FT FT F-
05 nc cc nc to to to F- to F- Kanban (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc FT FT F- FT FT F- FT nc FT FT F- FT FT F- FT nc FT FT F- FT FT F- FT nc FT FT F- FT FT F- FT nc F- F- F- FT FT F- T nc F- F- F- FT to F- T nc F- F- F- FT to F- to nc F- F- F- FT to F-
LamportFastMutEx (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara F nc nc nc nc nc nc3 nc nc F nc nc nc nc nc nc4 nc nc F nc nc nc nc nc nc5 nc nc F nc nc nc nc nc nc6 nc nc mp nc nc nc nc nc nc7 nc nc mp nc nc nc nc nc nc8 nc nc mp nc nc nc nc nc nc LamportFastMutEx (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- FT FT F- F? nc nc FT FT F- FT FT F- to nc nc F- F- to FT to F- to nc nc F- F- to to to F- to nc nc F- F- to to to F- to nc nc to to to to to F- MAPK (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
008 nc FT nc FT FT F- FT FT F-
020 nc FT nc F- F- F- FT FT F-
040 nc FT nc F- F- F- FT FT F-
080 nc to nc F- F- F- to FT F-
160 nc to nc F- F- F- to to F-
320 nc to nc F- F- F- to to F-
NeoElection (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara F nc nc nc nc nc nc3 nc nc F nc nc nc nc nc nc4 nc nc F nc nc nc nc nc nc5 nc nc mp nc nc nc nc nc nc6 nc nc mp nc nc nc nc nc nc7 nc nc mp nc nc nc nc nc nc8 nc nc mp nc nc nc nc nc nc NeoElection (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FF nc nc FF FF FF FF FT F- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. FF nc nc FF FF FF FF FT F-
FF FF FF FF to F-
FF FF FF FF to F-
FF FF FF FF to F-
FF FF FF FF to F-
FF FF FF FF to F-
PermAdmissibility (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc F nc nc nc nc nc nc02 nc nc mp nc nc nc nc nc nc05 nc nc mp nc nc nc nc nc nc10 nc nc mp nc nc nc nc nc nc20 nc nc mp nc nc nc nc nc nc50 nc nc mp nc nc nc nc nc nc PermAdmissibility (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FF FF nc FF FF FF FF FT F-
02 nc TF nc FF FF FF FF to F-
05 nc TF nc FF FF FF FF to F-
10 nc TF nc FF FF FF FF to F-
20 nc TF nc FF FF FF FF to F-
50 nc TF nc FF FF FF FF to F-
Peterson (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara F nc nc nc nc nc nc3 nc nc F nc nc nc nc nc nc4 nc nc mp nc nc nc nc nc nc5 nc nc mp nc nc nc nc nc nc6 nc nc mp nc nc nc nc nc nc7 nc nc mp nc nc nc nc nc nc Peterson (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- FT FT F-
F- F- F- to to F- to nc nc F- F- to to to F- to nc nc F- F- to F- to F- to nc nc F- F- to F- to F-
Philosophers (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FF FF nf FF FF FF FF FT F-
FF FF nf FF FF FF FF FT F-
FF FF nf FF FF FF FF FT F-
FF FF nf FF FF FF FF FT F-
FF to nf FF FF FF FF FT F- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. FF to nf FF FF FF FF FT F-
FF to nf FF FF FF to FT F-
FF mp nf FF FF FF to FT F-
FF mp nf FF FF FF to to F- mp nf FF FF FF to to F- cc nf FF FF FF to to F-
PhilosophersDyn (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to FF nc FF FF FF FF FT F-
10 nc mp nc FF FF FF FF to F- to mp nc FF FF FF FF to F-
Planning (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf nf nf
Railroad (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- FT FT F- to nc nc F- F- to to to F- to nc nc to to to to to F-
100 nc nc nc to to to to to F-
RessAllocation (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 FF nc nc FF FF FF FF FT F-
R003C002 FF nc nc FF FF FF FF FT F-
R003C003 FF nc nc FF FF FF FF FT F-
R003C005 FF nc nc FF FF FF FF FT F-
R003C010 FF nc nc FF FF FF FF FT F-
R003C015 FF nc nc FF FF FF FF FT F-
R003C020 FF nc nc FF FF FF FF FT F-
R003C050 FF nc nc FF FF FF FF FT F-
R003C100 FF nc nc FF FF FF FF FT F-
R005C002 FF nc nc FF FF FF FF FT F-
R010C002 FF nc nc FF FF FF FF FT F-
R015C002 FF nc nc FF FF FF FF FT F-
R020C002 FF nc nc FF FF FF FF FT F-
R050C002 FF nc nc FF FF FF FF FT F-
R100C002 F? nc nc FF FF FF FF FT F-
Ring (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc nc nc
F- F- F- to FT F-
RwMutex (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 FT nc nc FT FT F- FT FT F- r0010w0020 FT nc nc FT FT F- FT FT F- r0010w0050 FT nc nc FT FT F- FT FT F- r0010w0100 FT nc nc FT FT F- FT FT F- r0010w0500 FT nc nc FT FT F- FT FT F- r0010w1000 FT nc nc FT FT F- FT FT F- r0010w2000 FT nc nc FT FT F- FT to F- r0020w0010 FT nc nc FT FT F- FT FT F- r0100w0010 FT nc nc FT FT F- FT cc F- r0500w0010 FT nc nc FT FT F- FT cc F- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 FT nc nc FT FT F- FT cc F- r2000w0010 FT nc nc FT FT F- FT cc F-
SharedMemory (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FT FT nc FT FT F- FT FT F-
FT FT nc FT FT F- FT FT F-
FT mp nc F- F- to to FT F-
FT mp nc F- F- to to to F-
FT mp nc F- F- to to to F-
FT cc nc F- F- F- F- to F-
SimpleLoadBal (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc F nc nc nc nc nc nc05 nc nc F nc nc nc nc nc nc10 nc nc F nc nc nc nc nc nc15 nc nc mp nc nc nc nc nc nc20 nc nc mp nc nc nc nc nc nc SimpleLoadBal (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FT nc nc FT FT F- FT FT F- FT nc nc FT FT F- FT FT F- to nc nc FT FT F- FT FT F- to nc nc to to to to to F- to nc nc to to to to to F- TokenRing (colored)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FT FT nc FT FT F- FT FT F-
FT to nc FT FT F- FT FT F-
020 nc mp nc to to to to to F-
050 nc cc nc to to to to to F- “Surprise” Models Results are summarized in the table below.
HouseConstruction (P/T) instances
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
002 nc
FF FF FF FF FT F-
005 nc
FF FF FF FF FT F-
010 nc
FF FF FF FF FT F-
020 nc
FF FF FF FF FT F-
050 nc
FF FF FF FF cc F-
100 nc
FF FF FF FF cc F-
200 nc
FF FF FF FF cc F-
500 nc
FF FF FF FF to F-
IBMB2S565S3960 (P/T) instances
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc
FF FF FF FF FT F-
QuasiCertifProtocol (colored) instances
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc18 nc nc nc nc nc nc nc22 nc nc nc nc nc nc nc28 nc nc nc nc nc nc nc32 nc nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc FF FF FF FF FT F-
06 nc
FF FF FF FF FT F-
10 nc
FF FF FF FF to F-
18 nc
FF FF FF FF to F-
22 nc
FF FF FF FF cc F-
28 nc
FF FF FF FF cc F-
32 nc
FF FF FF FF cc F-
Vasy2003 (P/T) instances
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc
F- F- F- to FT F-
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
98 48 52 216 216 202 185 116 251CSRepetitions (Colored)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. CSRepetitions (P/T)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0 0 0best 0 0 2 0 0 0 0 0 0subtotal Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 5 0 16 16 16 7 9 16PhilosophersDyn (Colored)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 0 0 0 0 0 0 2subtotal Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
20 0 0 20 20 20 20 20 20Ring (P/T)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
17 0 0 17 17 17 17 8 17SharedMemory (Colored)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
11 3 0 11 11 8 8 4 11SimpleLoadBal (Colored)
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Cunf LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Sara LoLA LoLa opt
251 points 216 points 216 points
For “Surprise” Models
Sara LoLA LoLa opt LoLa opt inc
37 points 37 points 37 points 37 points
Global
Sara LoLA LoLa opt
325 points 290 points 290 points 100 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
This examination deals with reachability properties dealing with transition fireability only. We firstshow a summary on the handling of models by the participating tools. Then, we present the computedoutputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for ReachabilityFireability : memory / / , : s e c ond s CSRepetitions (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityFireability : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for ReachabilityFireability : memory / / , : s e c ond s Dekker (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for ReachabilityFireability : memory / / , : s e c ond s DotAndBoxes (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for ReachabilityFireability : memory / / , : s e c ond s DrinkVendingMachine (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityFireability : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 102 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Echo (P/T) for ReachabilityFireability : memory / / , : s e c ond s Echo (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for ReachabilityFireability : memory / / , : s e c ond s Eratosthenes (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for ReachabilityFireability : memory / / , : s e c ond s FMS (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 103 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (Colored) for ReachabilityFireability : memory / / , : s e c ond s GlobalRessAlloc (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for ReachabilityFireability : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for ReachabilityFireability : memory / / , : s e c ond s Kanban (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 104 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (Colored) for ReachabilityFireability : memory / / , : s e c ond s LamportFastMutEx (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for ReachabilityFireability : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for ReachabilityFireability : memory / / , : s e c ond s MAPK (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 105 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (Colored) for ReachabilityFireability : memory / / , : s e c ond s NeoElection (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for ReachabilityFireability : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for ReachabilityFireability : memory / / , : s e c ond s PermAdmissibility (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 106 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s PermAdmissibility (P/T) for ReachabilityFireability : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (Colored) for ReachabilityFireability : memory / / , : s e c ond s Peterson (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityFireability : memory / / , : s e c ond s Peterson (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityFireability examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 107 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Philosophers (P/T) for ReachabilityFireability : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityFire-ability examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityFireability : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityFireability exam-ination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for ReachabilityFireability : memory / / , : s e c ond s Railroad (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 108 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s RessAllocation (P/T) for ReachabilityFireability : memory / / , : s e c ond s RessAllocation (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for ReachabilityFireability : memory / / , : s e c ond s Ring (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for ReachabilityFireability : memory / / , : s e c ond s RwMutex (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityFire-ability examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 109 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SharedMemory (P/T) for ReachabilityFireability : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (Colored) for ReachabilityFireability : memory / / , : s e c ond s SimpleLoadBal (Colored) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityFireability : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityFireability examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 110 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s TokenRing (P/T) for ReachabilityFireability : memory / / , : s e c ond s TokenRing (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for ReachabilityFireability : memory / / , : s e c ond s HouseConstruction (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for ReachabilityFireability : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachability-Fireability examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). 111 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s QuasiCertifProtocol (P/T) for ReachabilityFireability : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for ReachabilityFireability : memory / / , : s e c ond s Vasy2003 (P/T) for ReachabilityFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc03 nc
FFFFFFFF nc nc nc nc nc nc04 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. CSRepetitions (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc FFFFFFTF FFFFFFTF FFFFFF-F cc FFFFFFFF FFFFFFFF FFFFFFFF nc TFTFFFTF TFTFFFTF -F-FFF-F TFTFFF-F FFFFFFFF TFTFF–- FFFFFTFF nc FFFFFFTF FFFFFFTF FFFFFF-F to to FFFFF–- to nc FF-FFF-F FF-FFF-F to to to TF–F–- mp nc FFFF-F-F FFFF-F-F to to to FFFFF–- mp nc FFFFFF-F FFFFFF-F to to to -F-F––
Dekker (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF cc
015 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF cc
020 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF cc
050 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to cc
100 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to cc
200 nc nc
FFFFFFFF FFFFFFFF nc to to cc DotAndBoxes (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFTTTF nc nc nc nc nc nc3 nc
FFFFF nc nc nc nc nc nc4 nc F nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc DrinkVendingMachine (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc10 nc cc nc nc nc nc nc nc DrinkVendingMachine (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
FFTFFTTF FFTFFTTF FF-FF–F FF-FF–F FFFFFTFF TFFF–-T
10 nc nc cc cc cc cc FFFFFFFF to
Echo (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc nc
FFFFFF-F FFFFFF-F to to to FFFFFFFF d02r11 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to to d02r15 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to to d02r19 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to to d03r03 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF to to TFFFTFFF d03r05 nc nc -F-FFFFF -F-FFFFF to to to FFFFFFFF d03r07 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to to d04r03 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to FFFFFFFF d05r03 nc nc -F-F-F-F -F-F-F-F to to to TFTFTFFF
Eratosthenes (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFTTFTTT
020 nc
FFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF
050 nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFTTT
100 nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFTTT
200 nc
FFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTTTT
500 nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFTTT
FMS (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFTF FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFF-FFF FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF–- FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FFF-F FFFFFFFF FFFFFFFF
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF ––-FFF FFFFFFFF FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF ––-FTF to FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF TFTFFFFF to FFFFFFFF
GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc
FFFF nc nc nc nc nc nc05 nc nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc FFFFFFTF FFFFFFTF FFFFFF-F to FFFFFFFF TTTT–– cc nc to to to cc to cc Kanban (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FFFFF FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF cc FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFF–- FFFFFFFF to
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFF–- FFFFFFFF FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF–- FFFFFFFF FFFFFFFF mp nc FFFFFFFF FFFFFFFF FFFFFFFF ––-F-F to FFFFFFFF mp nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FFFFF to FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF–- to FFFFFFFF
LamportFastMutEx (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc
FFFFFFFF nc nc nc nc nc nc5 nc
FFFFFFFF nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc LamportFastMutEx (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-F-FFF FFFFFFFF FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFTF FFFFFFFF FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF to FFFFFFFF FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF to to FFFFFFFF to nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to to
NeoElection (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFTTT nc nc nc nc nc nc3 nc
FFFFFTFF nc nc nc nc nc nc4 nc nc nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc nc nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc nc nc nc nc nc nc nc NeoElection (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TFTFTTTT TFTFTTTT -F-F–– TFTFTTTT FFFFFTTT TTTT–-T eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
TFTFFTTF TFTFFTTF -F-FF–F cc FFFFFTFF TTTTTTTT to to to to to -T-T-FFT to to to to to TTTTT–- to to to to to -T-T–– to to to to to TTTT–– to to to to to –––-T
PermAdmissibility (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc
FFFFFTFT nc nc nc nc nc nc02 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc50 nc mp nc nc nc nc nc nc PermAdmissibility (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to nc TFTFFFTF TFTFFFTF -F-FFF-F TFTFFFTF FFFFFTFT TT–-FFF FFFFTTTT nc FFFFFFFF FFFFFFFF FFFFFFFF to to FFFF–– FFFFTTTT nc FFFFFFFF FFFFFFFF FFFFFFFF to to FFFF–– FFFFTTTT nc FFFFFFFF FFFFFFFF FFFFFFFF to to FFFFF–- FFTTFTTT nc FFFFFFFF FFFFFFFF FFFFFFFF to to FF–F–- FFFFFTTT nc FFFFFFFF FFFFFFFF FFFFFFFF to cc to
Peterson (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc mp nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc Peterson (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFTTT FFFFFTTT FFFFF–- ––-TTT FFFFFFFF to
FFFFTTTF FFFFTTTF FFFF–-F FFFFT–- FFFFFFFF to
FF-F–– FF-F–– to to to to
FFFFF–- FFFFF–- to to to to
FFFFF–- FFFFF–- to to to to
FF-FF–F FF-FF–F to FF-FF–- to to
Philosophers (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFFTFFF nf FFTFFFTF FFTFFFTF FF-FFF-F FFTFFFTF FFFFFFFF TFFFFFFF
FTFTFFFF nf FFFFTTTF FFFFTTTF FFFF–-F FFFFTTTF FFFFFFFF TFTF-FFF
FTFTFFFT nf FFFF-F-F FFFF-F-F FFFF-F-F to FFFFFFFF TFTFF–- mp nf FF-FFFFF FF-FFFFF FF-FFFFF to FFFFFFFF TF––– mp nf FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF -F-F–– eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. mp nf FF-FFF-F FF-FFF-F FF-FFF-F to to -F––– to nf FF-FF–- FF-FF–- FF-FF–- to to -FFFF–- mp nf FF-FFF-F FF-FFF-F FF-FFF-F to to cc mp nf FFFFF–- FFFFF–- to to to cc mp nf FFFFFF-F FFFFFF-F FFFFFF-F to to cc cc nf FFFFF–F FFFFF–F to to to cc
PhilosophersDyn (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFTTFT nc TFTFFFTF TFTFFFTF -F-FFF-F TFTFFFTF FFFFTTFT TF––– mp nc TFTFFFTF TFTFFFTF -F-FFF-F to to -T-T–– mp nc to to to to to cc Planning (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFF-F FFFFFFFF to
010 nc nc
TFTFFFTF TFTFFFTF -F-FFF-F ––F–- FFFFFTFT TTTTTFFF
020 nc nc -F-F-F-F -F-F-F-F to to to to
050 nc nc to to to to to to
100 nc nc to to to to to to
RessAllocation (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc nc
TFTFFFTF TFTFFFTF -F-FFF-F TFTFFFTF FFFFFTFT TFFFFFTF
R003C002 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F ––-FTF FFFFFTFT FFFFFFTF
R003C003 nc nc
TFTFFFTF TFTFFFTF -F-FFF-F -F-FFFTF FFFFFTFT TFTFFFTF
R003C005 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F FFFFFFTF FFFFFTFF FFFFFFFF
R003C010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF -F-FFF-F FFFFFFFF TFTFFFFF
R003C015 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F -F-FFF-F FFFFFTFT FFFFFFFF
R003C020 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFTF FFFFFFFF FFFFFFFF
R003C050 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to FFFFFFFF FFFFFFFF
R003C100 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to FFFFFFFF FFFFFFFF
R005C002 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF TFTF-FTF FFFFFFFF to
R010C002 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF TFTFFFFF FFFFFFFF FFFFTFFF
R015C002 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF TFFFFFFF
R020C002 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF
R050C002 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF to FFFFFFFF TFFFFFFF
R100C002 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to FFFFFFFF FFFFFFFF
Ring (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc nc -F-F-FFF -F-F-FFF -F-F-FFF to FFFFFFFF TFTFTFFF
RwMutex (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFTFFFF TFFFFFFF r0010w0020 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF TFFFTFTF r0010w0050 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF TFTFTFFF FFFTFFFF TFFFTFTF r0010w0100 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF cc FFFFFFFT TFTFTFTF r0010w0500 nc nc
TFTFFFTF TFTFFFTF -F-FFF-F TFTFFFTF FFFFFTFT TFTFFFFF r0010w1000 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F FFFFFFTF FFFTTTFT FFTFTFFF r0010w2000 nc nc
TFTFTFTF TFTFTFTF -F-F-F-F to to TFFFTFFF r0020w0010 nc nc
TFTFTFTF TFTFTFTF -F-F-F-F -F-F-FTF to TFFFTFFF r0100w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF ––-F-F cc FFFFFFFF r0500w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFF–- cc FFFFFFFF eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF ––-FFF cc FFFFFFFF r2000w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to cc FFFFFFFF
SharedMemory (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFTFFFT nc FFFFTFTF FFFFTFTF FFFF-F-F ––-F-F FFFFFFFF TFTFTTTT
TTFFFFFF nc FFTFTFTF FFTFTFTF FF-F-F-F to FFFFFTFT TFFFF–- mp nc FFFFFF-F FFFFFF-F FFFFFF-F to FFFFFFFF TFTFF–- mp nc FFFFFF-F FFFFFF-F to to to FFFFF–- mp nc to to to to to cc cc nc cc cc cc cc to to SimpleLoadBal (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc05 nc
FFFFFFFF nc nc nc nc nc nc10 nc
FFFFFFFF nc nc nc nc nc nc15 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc SimpleLoadBal (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F FFFFFTTF FFFFFFFF to
05 nc nc
FFFFFFTF FFFFFFTF FFFFFF-F ––-FTF FFFFFFFF to
10 nc nc to to to to FFFFFFFF to
15 nc nc to to to to to to
20 nc nc to to to to to to
TokenRing (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFTFTFF nc TFTFTTTF TFTFTTTF -F-F–-F -F-F–– FTFTFTFF to to nc TFTFTTTF TFTFTTTF -F-F–-F -F––– FTFFFTFF cc mp nc to to to to to cc cc nc cc cc cc cc to cc “Surprise” Models Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FFFFFFFF FFFFFFFF FFFFFFFF -F-F–– to cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none –-F-F-F –-F-F-F –-F-F-F to TTFFFTFF –TFTFFF
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
44 59 200 200 161 106 120 151CSRepetitions (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0 0best 0 2 0 0 0 0 0 0subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 0 11 11 11 2 2 6Peterson (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 2 2 0 0 0 0subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 12 6 18 6HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc
200 points 200 points 161 points
For “Surprise” Models
Marcie ITS − Tools LoLA LoLa opt LoLa opt inc
18 points 12 points 12 points 12 points 12 points
Global
LoLA LoLa opt LoLa opt inc
224 points 224 points 185 points 124 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
10 The ReachabilityMarkingComparison Examination
This examination deals with reachability properties dealing with marking comparison only. We firstshow a summary on the handling of models by the participating tools. Then, we present the computedoutputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCompari-son examination.
DotAndBoxes (colored)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
Reachabili-tyMarkingComparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
No instance of this model could be computed for the
ReachabilityMarkingComparison examination. 125 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Eratosthenes (P/T)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination.
FMS (P/T)
No instance of this model could be computed for the
ReachabilityMarkingComparison examination.
GlobalRessAlloc (colored)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCompari-son examination.
LamportFastMutEx (colored)
No instance of this model could be computed for the
Reachability-MarkingComparison examination.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCompari-son examination.
NeoElection (colored)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination. 126 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
Reachability-MarkingComparison examination.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
ReachabilityMarkingCom-parison examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s Peterson (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCompar-ison examination.
Railroad (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCompar-ison examination.
RessAllocation (P/T)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination.
Ring (P/T)
No instance of this model could be computed for the
ReachabilityMarkingComparison examination.
RwMutex (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCom-parison examination.
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination. 128 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityMarking-Comparison examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s TokenRing (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
HouseConstruction (P/T)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
IBMB2S565S3960 (P/T)
No instance of this model could be computed for the
ReachabilityMark-ingComparison examination.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachability-MarkingComparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for ReachabilityMarkingComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
No instance of this model could be computed for the
ReachabilityMarkingCom-parison examination.
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFFTFFF FFFFTTTT cc TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFTFFFF to cc -FFFF–- -FFFF–- -FFFF–- to to to to FFFF–FF FFFF–FF to to to FFFFTTT- cc FFFFF–- FFFFF–- to to to to cc ––-FFF ––-FFF to to to FFFFFFFF Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nf nf nf nf nf nf nf015 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf
DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
TFFFFTFT TFFFFTFT -FFFF-F- TFFFFTFT FFFTTFFF to
10 nc cc cc cc cc FFFTFFFF to
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nf nf nf nf nf nf nfd02r11 nf nf nf nf nf nf nfd02r15 nf nf nf nf nf nf nfd02r19 nf nf nf nf nf nf nfd03r03 nf nf nf nf nf nf nfd03r05 nf nf nf nf nf nf nfd03r07 nf nf nf nf nf nf nfd04r03 nf nf nf nf nf nf nfd05r03 nf nf nf nf nf nf nf
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
002 nf nf nf nf nf nf nf005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc TFFFTTFF TFFFTTFF -FFF–FF to FFFTFFFF to cc to to to –––F- to to Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF FFFFFFFF cc cc cc cc FFFTFFFF FFFFFFFF cc cc cc cc FFFTFFFF FFFFFFFF cc cc cc cc to FFFFFFFF cc cc cc cc to FFFFFFFF cc cc cc cc to FFFFFFFF cc cc cc cc to FFFFFFF-
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
008 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf040 nf nf nf nf nf nf nf080 nf nf nf nf nf nf nf160 nf nf nf nf nf nf nf320 nf nf nf nf nf nf nf
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTTTFFF TTTTTFFF ––-FFF TTTTTFFF FFFFFFFF TTTTTFFF eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
TTTFFTTT TTTFFTTT –-FF–- TTTFFTTT FFFTTFFF TTTTTFTF to to to to to TTTTTTTT to to to to to TTTTTTTT to to to to to FFFFFFTF
TTTTFTFT TTTTFTFT ––F-F- to to cc to to to to to TTTTTTTT
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara ?????FFF TFTFTFFF TFTFTFFF -F-F-FFF cc FFFFFFFF FFFFFFFF cc FFFFF-F- FFFFF-F- to to to FFTTFFFF ?????FTT –FFFFFF –FFFFFF to to to FFFFTFFF ?????FFF -F-F-FFF -F-F-FFF to to to FFFFFFFF ?????TTT -F-FF-F- -F-FF-F- to to to to cc –-F–FT –-F–FT to to to to Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTFTTTT TTTFTTTT –-F–– TTTF-TTT FFFTFFFF FTTTT-T-
TFFFFTTT TFFFFTTT -FFFF–- TFFFFTTT FFFTTFFF FTFF-TTT ––FFFF ––FFFF to to to TTTT-FF- -F-FF-F- -F-FF-F- to to to TTTTTTTT –––F- –––F- to to to TTTTTFFF –-FF-F- –-FF-F- to to to FTTT––
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc TTTTFFFF TTTTFFFF ––FFFF TTTTFFFF FFFFTFFF TTTTTFFF cc TFFFFTFF TFFFFTFF -FFFF-FF TFFFFTFF FFFTFFFF FFFFTTTF cc -F-FFFFF -F-FFFFF -F-FFFFF to FFFFTFFF FFFFTFFF cc -F-FF-F- -F-FF-F- -F-FF-F- to FFFTFFFF TTTTTFFF cc FFFFF-F- FFFFF-F- FFFFF-F- to FFFTTFFF FF–-TTT eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc FFFFF-F- FFFFF-F- FFFFF-F- to FFFFFFFF FFFFFTT- to -F-F–F- -F-F–F- to to FFFFFFFF FFFFFTTT mp -F-FFFFF -F-FFFFF -F-FFFFF to FFFFFFFF -T-T–F- mp -FFFF-F- -FFFF-F- -FFFF-F- to to cc mp -F-FF-FF -F-FF-FF FFFFF-FF to to cc cc -F-FF-F- to to to to cc
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc TFTFFTFT TFTFFTFT -F-FF-F- TFTFFTFT FFFFFFFF FFFF-FF- cc TFTFFTTT TFTFFTTT -F-FF–- TFTFFTTT to to mp to to to to to to Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nf nf nf nf nf nf nfR003C002 nf nf nf nf nf nf nfR003C003 nf nf nf nf nf nf nfR003C005 nf nf nf nf nf nf nfR003C010 nf nf nf nf nf nf nfR003C015 nf nf nf nf nf nf nfR003C020 nf nf nf nf nf nf nfR003C050 nf nf nf nf nf nf nfR003C100 nf nf nf nf nf nf nfR005C002 nf nf nf nf nf nf nfR010C002 nf nf nf nf nf nf nfR015C002 nf nf nf nf nf nf nfR020C002 nf nf nf nf nf nf nfR050C002 nf nf nf nf nf nf nfR100C002 nf nf nf nf nf nf nf
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf nf
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nf nf nf nf nf nf nfr0010w0020 nf nf nf nf nf nf nfr0010w0050 nf nf nf nf nf nf nfr0010w0100 nf nf nf nf nf nf nfr0010w0500 nf nf nf nf nf nf nfr0010w1000 nf nf nf nf nf nf nfr0010w2000 nf nf nf nf nf nf nfr0020w0010 nf nf nf nf nf nf nfr0100w0010 nf nf nf nf nf nf nfr0500w0010 nf nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 nf nf nf nf nf nf nfr2000w0010 nf nf nf nf nf nf nf
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc TFTFTTFF TFTFTTFF -F-F–FF -F-F–F- FFFFFFFT FFFFFTTT cc TFFFFFFT TFFFFFFT -FFFFFF- -FFFFFF- FFFTTFFF FTFFTFFT mp to to to to FFFFFFFF FFFFFFFF mp to -FFFF-FF to to to cc mp to to to to to cc cc cc cc cc cc to cc
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
TTTFFTFT TTTFFTFT –-FF-F- –-FF-F- FFFTTFFF TTTTTFFF
05 nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFFTFT FFFFTFFF FFFF-FF-
10 nc to to to to FFFFFFFF to
15 nc to to to to to to
20 nc to to to to to to
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc TTTFTTFT TTTFTTFT –-F–F- TTTFTTFT FFFTFFFF TTTTTTTT cc TTTFTTFT TTTFTTFT –-F–F- TTTFTTFT FFFTFFFF FFF-FTTT mp to to to to to FFF–FF- cc to to to to to cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
002 nf nf nf nf nf nf005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF FFFFFFFF cc cc cc cc FFFTFFFF FFFFFFFF cc cc cc cc to FFFFFFFF cc cc cc cc to FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Sara LoLA LoLa opt
71 points 71 points 69 points
For “Surprise” Models
Sara Marcie
12 points 3 points
Global
Sara LoLA LoLa opt
95 points 71 points 69 points 142 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
11 The ReachabilityPlaceComparison Examination
This examination deals with reachability properties dealing with the comparison of places markingonly. We first show a summary on the handling of models by the participating tools. Then, we presentthe computed outputs and the associated scores for this examination prior to a summary of relevantexecutions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s CSRepetitions (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Dekker (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s DotAndBoxes (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s DrinkVendingMachine (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 144 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Echo (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Echo (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Eratosthenes (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s FMS (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 145 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s GlobalRessAlloc (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Kanban (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 146 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s LamportFastMutEx (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s MAPK (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 147 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s NeoElection (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s PermAdmissibility (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 148 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s PermAdmissibility (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s Peterson (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Peterson (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityPlaceCom-parison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 149 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Philosophers (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityPlace-Comparison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityPlaceComparison examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Railroad (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 150 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s RessAllocation (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s RessAllocation (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Ring (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s RwMutex (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityPlace-Comparison examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 151 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SharedMemory (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (Colored) for ReachabilityPlaceComparison : memory / / , : s e c ond s SimpleLoadBal (Colored) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityPlaceCom-parison examination.
TokenRing (P/T)
No instance of this model could be computed for the
ReachabilityPlaceCompar-ison examination. 152 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s HouseConstruction (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachability-PlaceComparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for ReachabilityPlaceComparison : memory / / , : s e c ond s Vasy2003 (P/T) for ReachabilityPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc nc03 nc
FFFFFFFF nc nc nc nc nc nc04 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc CSRepetitions (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFTFFFF nc TTTFFFFT TTTFFFFT –-FFFF- –-FFFF- FFFTTFFF ––-TT- FFFFFFFF nc TTTTFFFT TTTTFFFT ––FFF- TTTTFFFT FFFFTFFF ––-TT- FFFTTFFF nc FFTFF–- FFTFF–- to to to cc to nc -FFFF–- -FFFF–- to to to cc mp nc ––F–- ––F–- to to to cc mp nc –-FF-FF –-FF-FF to to to –––T- Dekker (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFFFFFF cc
015 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- to FFFFFFFF cc
020 nc nc to to to to FFFFTFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
050 nc nc to to to to to cc
100 nc nc to to to to to cc
200 nc nc nc to to to to cc
DotAndBoxes (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFTFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc cc nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc DrinkVendingMachine (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc10 nc
FFFFFFFF nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TTTTTTFT TTTTTTFT –––F- TTTTTTFT FFFFFFFF cc
10 nc nc cc cc cc cc FFFFTFFF cc
Echo (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc nc -F-FFFFF -F-FFFFF to -F-FF–- to cc d02r11 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to cc d02r15 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF –––-F to –––-T d02r19 nc nc -FFFF–- -FFFF–- to to to cc d03r03 nc nc -F-FFFFF -F-FFFFF to to to ––-TT- d03r05 nc nc ––F-FF ––F-FF to to to cc d03r07 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to cc d04r03 nc nc -FFFF-F- -FFFF-F- to to to cc d05r03 nc nc -F-FFFFF -F-FFFFF to to to ––-TTT
Eratosthenes (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FFFFFFFF FFFFFTTT FFFFFTTT FFFFF–- FFTFFTTT FFFTFFFF cc
020 nc
FFFF FFFFFFFF FFFFFFFF FFFFFFFF FF-FFFFF FFFTTFFF cc
050 nc
FFFF to to to TF–FTFF FFFTFFFF cc
100 nc
FFFFFFFF to to to TFFFTTF- FFTTFFFF cc
200 nc
FFFF to to to to FFFFTFFF ––-TTT
500 nc
FFFFFFFF to to to to FFFTFFFF cc
FMS (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFTF nc TTTTFFFF TTTTFFFF ––FFFF ––FFF- FFFFTFFF –––-T
FFFFFFFF nc TTTTFTFT TTTTFTFT ––F-F- ––F-F- FFFFTFFF cc
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTFFF cc
FFFFFFFF nc T-T-F-FF T-T-F-FF ––F-FF ––F-FF FFFFTFFF cc to nc –––FF –––FF to –––-F FFFFFFFT cc mp cc -F-FFFFF -F-FFFFF -F-FFFFF -F-FF-FF FFFFTFFF –––-T to nc FFFFFFFF FFFFFFFF FFFFFFFF ––-FF- to cc to nc -F-FFFFF -F-FFFFF -F-FFFFF -F-FF-F- to cc GlobalRessAlloc (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc
FFFFFFFF nc nc nc nc nc nc05 nc
FTFTFFFF nc nc nc nc nc nc06 nc
FFFFFFFF nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc09 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc11 nc mp nc nc nc nc nc nc GlobalRessAlloc (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TFTFFTFF TFTFFTFF -F-FF-FF to FFFTFFFF cc cc nc to to to cc to to Kanban (P/T) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF ––F–- FFFFTFFF ––-TT-
FFFFFFFF nc FFFFFTFT FFFFFTFT FFFFF-F- -F-F–– FFTTTFFF cc
FFFFFFFF nc -F-FFFFF -F-FFFFF to -F-FFFFF FFFFFFFF cc to nc –-FF-F- –-FF-F- –-FF-F- –-FF–- FFFTTFFF cc to nc FFFFFFFF FFFFFFFF FFFFFFFF ––F-F- FFFFTFFF cc
TTTTT nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFF-FF to cc mp nc cc cc cc cc to cc to nc -F-F-FFF -F-F-FFF -F-F-FFF -F-F-FF- to cc LamportFastMutEx (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc
FTFFFFFF nc nc nc nc nc nc5 nc
FFFFFFFF nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc LamportFastMutEx (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF ––-TTT cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFTFFFF nc TTTFTTTT TTTFTTTT –-F–– –-F–– FFFTFFFF cc
FFFFFFFF nc -FFFF-FF -FFFF-FF -FFFF-FF -FFFF-FF FFFTFFFT cc to nc -F-F-FFF -F-F-FFF -F-F-FFF -F-F-FFF FFFFFFFF ––-TT- to nc ––-FFF ––-FFF ––-FFF to FFFFFFFF cc to nc -F-FFFFF -F-FFFFF -F-FFFFF to to cc to nc –FFFFF- –FFFFF- –FFFFF- to to –––-T NeoElection (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFF nc nc nc nc nc nc4 nc
FTFTFFTF nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc NeoElection (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTFFTTT TTTFFTTT –-FF–- TTTFFTTT FFFTTFFF cc
TTTFFTTT TTTFFTTT –-FF–- TTTFFTT- FFFTTFFF –––-T -FFF-TFT -FFF-TFT to to to cc to to to to to cc to to to to to cc to to to to to cc to to to to to cc
PermAdmissibility (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc
FFFFFFFF nc nc nc nc nc nc02 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
50 nc mp nc nc nc nc nc nc PermAdmissibility (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to nc FFFFFTTT FFFFFTTT FFFFF–- FFFFF–- FFFFFFFF cc ?????FTT nc T–FFFFF T–FFFFF to to to cc TTTTT??? nc FFFFF-F- FFFFF-F- to to to cc FTFTT??? nc -F-FF-F- -F-FF-F- to to to cc FTFFTFTT nc -F-FFFFF -F-FFFFF to to to cc FFFTF??? nc to to to to cc cc Peterson (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc mp nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc Peterson (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTTTTFT TTTTTTFT –––F- TTTTT-F- FFFFFFFF –––T-
TFTFFFFF TFTFFFFF -F-FFFFF -F-FFFFF FFFFTFFF cc –-F–FF –-F–FF to to to –––-T
FF-FF-FF FF-FF-FF to to to cc
FFFFF-FF FFFFF-FF to to to cc -F-FF–- -F-FF–- to to to cc
Philosophers (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nf TFTFTFFF TFTFTFFF -F-F-FFF TFTFT–- FFFFFFFF –––-T
FFFTFFFF nf TTFFFTFF TTFFFTFF –FFF-FF –FFFTFF FFTTTFFF cc
FFFFFFFF nf ––FFFF ––FFFF ––FFFF to FFFFTFFF cc FFFFFFFF nf -FFFFFFF -FFFFFFF -FFFFFFF FFFF-FFF FFFTTFFF cc FFFFFFFF nf -F-FF-F- -F-FF-F- -F-FF-F- to FFFFFFFF cc FFFFFFFF nf -F-FFFFF -F-FFFFF -F-FFFFF to FFFFFFFF cc to nf –-FF-FF –-FF-FF to to FFFTTFFF cc mp nf -F-FF-F- -F-FF-F- -F-FF-F- to FFFTTFFF cc mp nf -F-FF-F- -F-FF-F- to to to cc mp nf -FFF–F- -FFF–F- to to to cc cc nf to to to to to cc PhilosophersDyn (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TTTTTFFF TTTTTFFF ––-FFF TTTTTFFF FFFFFFFF cc mp nc TFFFFTFT TFFFFTFT -FFFF-F- TFFFFTFT to cc mp nc to to to to to cc Planning (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFTTFFF cc
010 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFF–- FFFFTFFF cc
020 nc nc -F-FF-F- -F-FF-F- to to to cc
050 nc nc to to to to to cc
100 nc nc to to to to to cc
RessAllocation (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc nc
TTTTFTFF TTTTFTFF ––F-FF ––F–- FFFFTFFF cc
R003C002 nc nc
TTTTFTFT TTTTFTFT ––F-F- TTTTFTFT FFFFTFFF ––-TTT
R003C003 nc nc
TTTTTFFF TTTTTFFF ––-FFF TTTTTFFF FFFFFFFF cc
R003C005 nc nc
TFTFFTTF TFTFFTTF -F-FF–F -F-FF–F FFFFTFFT cc
R003C010 nc nc
TTTFTTFT TTTFTTFT –-F–F- –-F–F- FFFTFFFF cc
R003C015 nc nc
TTTTTFFF TTTTTFFF ––-FFF ––-FFF FFFFFFFT cc
R003C020 nc nc
FFFFF-F- FFFFF-F- to FFFFFTFT FFTTTFFF cc
R003C050 nc nc -F-F-FFF -F-F-FFF to to FFFFFFFF ––-TT-
R003C100 nc nc -F-FFFFF -F-FFFFF to to FFFFFFFF ––-TTT
R005C002 nc nc
FFFFFTFF FFFFFTFF FFFFF-FF FFFFFTFF FFFFFFFF cc
R010C002 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFFFFFF FFFTTFFF cc
R015C002 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFFFFFF FFFTFFFF cc
R020C002 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF -F-FFFFF FFFFTFFF cc
R050C002 nc nc –––F- –––F- to to FFFFFFFF cc
R100C002 nc nc
FFFFF-F- FFFFF-F- to FFFFFFFF FFFTFFFF cc
Ring (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc nc -F-FF-FF -F-FF-FF -F-FF-FF to FFFFTFFT –––-F
RwMutex (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF ––-FFF FFFFFFFF cc r0010w0020 nc nc
FFFFFTTT FFFFFTTT FFFFF–- FF-F-TTT FFFTFFFF cc r0010w0050 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF ––-FFF FFFFFFFF cc r0010w0100 nc nc
TTTTTTTT TTTTTTTT cc cc FFFFFFFF cc r0010w0500 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFF-F- FFFTTFFF cc r0010w1000 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFF-FFF FFFTTFFF cc r0010w2000 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- to to cc r0020w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FF–FFFF to cc r0100w0010 nc nc
TTTTTFFF TTTTTFFF ––-FFF –––F- cc cc r0500w0010 nc nc
TFFFTTFT TFFFTTFT -FFF–F- -FFF–F- cc cc r1000w0010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF ––F–- cc cc r2000w0010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF cc cc cc
SharedMemory (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc nc nc nc nc nc nc000010 nc cc nc nc nc nc nc nc000020 nc cc nc nc nc nc nc nc000050 nc cc nc nc nc nc nc nc000100 nc cc nc nc nc nc nc nc000200 nc cc nc nc nc nc nc nc000500 nc cc nc nc nc nc nc nc001000 nc cc nc nc nc nc nc nc002000 nc cc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc nc nc nc nc nc nc010000 nc cc nc nc nc nc nc nc020000 nc cc nc nc nc nc nc nc050000 nc cc nc nc nc nc nc nc100000 nc cc nc nc nc nc nc nc SharedMemory (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF cc TFFFFTFT TFFFFTFT -FFFF-F- –-FF-F- FFFTTFFF cc
FFFFFFFF cc TTTTFTFT TTTTFTFT ––F-F- to FFFFTFFF cc mp cc -F-FF-FF -F-FF-FF to to FFFFFFFT cc mp cc to to to to to cc mp cc to to to to to ––-TTT cc cc cc cc cc cc to cc
SimpleLoadBal (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc05 nc
FFFFFFFF nc nc nc nc nc nc10 nc
FFFFFFFF nc nc nc nc nc nc15 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc SimpleLoadBal (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TTTTTTFT TTTTTTFT –––F- TTTTT–- FFFFFFFF cc
05 nc nc
TFFFFFFF TFFFFFFF -FFFFFFF TFFF-TFT FFFTTFFF ––-TTT
10 nc nc to to to to FFFFFFFF cc
15 nc nc to to to to to cc
20 nc nc to to to to to cc
TokenRing (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf nf
TokenRing (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTTFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTFFF cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc –––-T cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none -F-F–F- -F-F–F- to to FFFFFFFF cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
43 61 170 170 116 98 120 55CSRepetitions (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
DotAndBoxes (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 2 2 2 2 0 0best 0 0 2 2 2 2 0 0subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 0 6 6 2 2 2 0Peterson (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 2 2 2 0 2 2subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 6 6 22 4HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models
LoLA LoLa opt LoLa pess Marcie
170 points 170 points 120 points 120 points
For “Surprise” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Marcie LoLA LoLa opt
22 points 12 points 12 points
Global
LoLA LoLa opt Marcie
194 points 194 points 164 points 166 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
12 The ReachabilityMix Examination
This examination deals with reachability properties dealing with all the previous type of atomicproposition. We first show a summary on the handling of models by the participating tools. Then, wepresent the computed outputs and the associated scores for this examination prior to a summary ofrelevant executions.
CSRepetitions (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (Colored) for ReachabilityMix : memory / / , : s e c ond s CSRepetitions (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for ReachabilityMix : memory / / , : s e c ond s CSRepetitions (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for ReachabilityMix : memory / / , : s e c ond s Dekker (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
DotAndBoxes (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s DotAndBoxes (Colored) for ReachabilityMix : memory / / , : s e c ond s DotAndBoxes (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (Colored) for ReachabilityMix : memory / / , : s e c ond s DrinkVendingMachine (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for ReachabilityMix : memory / / , : s e c ond s DrinkVendingMachine (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 168 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Echo (P/T) for ReachabilityMix : memory / / , : s e c ond s Echo (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for ReachabilityMix : memory / / , : s e c ond s Eratosthenes (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s FMS (P/T) for ReachabilityMix : memory / / , : s e c ond s FMS (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
ReachabilityMix examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 169 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s GlobalRessAlloc (P/T) for ReachabilityMix : memory / / , : s e c ond s GlobalRessAlloc (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for ReachabilityMix : memory / / , : s e c ond s Kanban (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (Colored) for ReachabilityMix : memory / / , : s e c ond s LamportFastMutEx (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 170 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s LamportFastMutEx (P/T) for ReachabilityMix : memory / / , : s e c ond s LamportFastMutEx (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for ReachabilityMix : memory / / , : s e c ond s MAPK (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s NeoElection (Colored) for ReachabilityMix : memory / / , : s e c ond s NeoElection (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 171 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s NeoElection (P/T) for ReachabilityMix : memory / / , : s e c ond s NeoElection (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s PermAdmissibility (Colored) for ReachabilityMix : memory / / , : s e c ond s PermAdmissibility (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for ReachabilityMix : memory / / , : s e c ond s PermAdmissibility (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). 172 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Peterson (Colored) for ReachabilityMix : memory / / , : s e c ond s Peterson (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for ReachabilityMix : memory / / , : s e c ond s Peterson (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
ReachabilityMix exam-ination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for ReachabilityMix : memory / / , : s e c ond s Philosophers (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
ReachabilityMix examination. 173 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for ReachabilityMix : memory / / , : s e c ond s PhilosophersDyn (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
ReachabilityMix examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for ReachabilityMix : memory / / , : s e c ond s Railroad (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for ReachabilityMix : memory / / , : s e c ond s RessAllocation (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 174 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Ring (P/T) for ReachabilityMix : memory / / , : s e c ond s Ring (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for ReachabilityMix : memory / / , : s e c ond s RwMutex (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
ReachabilityMix ex-amination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for ReachabilityMix : memory / / , : s e c ond s SharedMemory (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 175 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SimpleLoadBal (Colored) for ReachabilityMix : memory / / , : s e c ond s SimpleLoadBal (Colored) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for ReachabilityMix : memory / / , : s e c ond s SimpleLoadBal (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
ReachabilityMix exami-nation.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for ReachabilityMix : memory / / , : s e c ond s TokenRing (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). 176 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s HouseConstruction (P/T) for ReachabilityMix : memory / / , : s e c ond s HouseConstruction (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for ReachabilityMix : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
Reachabili-tyMix examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for ReachabilityMix : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). 177 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Vasy2003 (P/T) for ReachabilityMix : memory / / , : s e c ond s Vasy2003 (P/T) for ReachabilityMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc03 nc
FTFTFFFF nc nc nc nc nc nc04 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc07 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc CSRepetitions (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF -F-FF–- FFFFFFFF cc FTFTFFFF nc TFTFFTFT TFTFFTFT -F-FF-F- TFTFF–- FFFFTFFF –––T- to nc FFFF-FFF FFFF-FFF FFFF-FFF –––F- to TFTF–-T to nc -F-FF-F- -F-FF-F- to to to cc mp nc -F-FF–- -F-FF–- to to to cc mp nc –––F- –––F- to to to ––-TTT Dekker (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFTFFFF cc
015 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFTFFFF cc
020 nc nc to to –-FFFFF to FFFTTFFF cc
050 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to cc
100 nc nc to to to to to cc
200 nc nc nc
FFFFFFFF FFFFFFFF to to cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
DotAndBoxes (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFTF nc nc nc nc nc nc4 nc cc nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc DrinkVendingMachine (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc10 nc cc nc nc nc nc nc nc DrinkVendingMachine (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFF-F- FFFFFFFF cc
10 nc nc cc cc cc cc FFFTFFFF cc
Echo (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc nc
FFFFF-F- FFFFF-F- to ––F–- to cc d02r11 nc nc -F-FFFFF -F-FFFFF to to to cc d02r15 nc nc -F-FF-F- -F-FF-F- to to to cc d02r19 nc nc -FFFFFFF -FFFFFFF to to to cc d03r03 nc nc
FFFFF-FF FFFFF-FF to FFFFFFF- to –––-F d03r05 nc nc
FFFFF-F- FFFFF-F- to to to ––-TTT d03r07 nc nc -F-FFFFF -F-FFFFF to to to cc d04r03 nc nc -FFFFFFF -FFFFFFF to to to ––-FF- d05r03 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF to to cc
Eratosthenes (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FFFFFFFF FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFFFFFF FFTTFTTT
020 nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFF–F- FFFFFFFF cc
050 nc
FFFF to to to -F-FFFFF FFTTTFFF cc
100 nc
FFFFFFFF -F-FFFFF -F-FFFFF to -F-FFFFF FFFFFFFF ––-FFF
200 nc
FFFF TFTFFFFF TFTFFFFF -F-FFFFF to FFFFFFFF cc
500 nc
FFFF FFFFFFFF FFFFFFFF FFFFFFFF to FFFFFFFF cc
FMS (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFF-F- FFFFFFFF cc
FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF cc FFFFFFFF cc
FFFFFFFF nc TFTFFFFF TFTFFFFF -F-FFFFF ––-FFF FFFFFFFF cc
FFFFFFFF nc TFFFFFFF TFFFFFFF -FFFFFFF –-F–F- FFFTFFFF cc
FFFFFFFF nc FFFFF-F- FFFFF-F- FFFFF-F- FFFFF-F- FFFTFFFF cc mp F ––-FFF ––-FFF ––-FFF –––F- FFFFFFFF –––T- to nc -F-FFFFF -F-FFFFF -F-FFFFF cc to cc to nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF-F- to FFFFF-T-
GlobalRessAlloc (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TFTFTTFT TFTFTTFT -F-F–F- to FFFTFFFF cc cc nc to to to -F-FF-F- to to Kanban (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFTFT FFFFFTFT FFFFF-F- FFFF–F- FFFFFFFF cc
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF–- FFFFFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
FFFFFFFF nc -F-FFFFF -F-FFFFF -F-FFFFF ––-FFF FFFFFFFF ––-FFF FFFFFFFF nc FFFFF-F- FFFFF-F- FFFFF-F- FFFFF-F- FFFFFFFF cc mp nc -F-FF–- -F-FF–- -F-FF–- cc FFFFFFFF cc mp nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF-F- to –––T- mp nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FF–- to –––T- to nc -F-FFFFF -F-FFFFF -F-FFFFF ––F-F- to –––F- LamportFastMutEx (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc
FFFFFFFF nc nc nc nc nc nc5 nc
FTFTFFFF nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc8 nc mp nc nc nc nc nc nc LamportFastMutEx (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc TTTTTFFF TTTTTFFF ––-FFF –––FF FFFFFFFF –––-T
FFFFFFFF nc FFFFFFFF FFFFFFFF FFFFFFFF -F-FFFFF FFFFFFFF cc to nc –-FFFFF –-FFFFF –-FFFFF –-FF-F- FFFTTFFF ––-TTT to nc FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFTFFF cc to nc FFFFFFFF FFFFFFFF FFFFFFFF to to cc to nc -FFFFFFF -FFFFFFF -FFFFFFF to to –––F- NeoElection (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc nc nc nc nc nc nc nc5 nc nc nc nc nc nc nc nc6 nc nc nc nc nc nc nc nc7 nc nc nc nc nc nc nc nc8 nc nc nc nc nc nc nc nc
NeoElection (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTTTTFT TTTTTTFT –––F- TTTTTTFT FFFFFFFF ––-TTT
TFTFFTFT TFTFFTFT -F-FF-F- TFTFFTFT FFFFTFFF cc cc cc to to to cc -F-FFFFF -F-FFFFF to to to ––-TTT to to to to to cc to to to to to cc
FFFFF-FF FFFFF-FF to to to cc
PermAdmissibility (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc
FFFFFFFF nc nc nc nc nc nc02 nc mp nc nc nc nc nc nc05 nc mp nc nc nc nc nc nc10 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc50 nc mp nc nc nc nc nc nc PermAdmissibility (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. to nc TFTFFTFF TFTFFTFF -F-FF-FF TFTFFTFF FFFFFFFF ––-TT- ?????FFF nc -F-FF-F- -F-FF-F- to to to cc FFFTTFTF nc to to to to to –––F- FFFTTFFF nc -F-FFFFF -F-FFFFF to to to cc TTTTTFFF nc FFFFFFFF FFFFFFFF FFFFFFFF FFFF-FFF to to ?????FTF nc to to to to cc cc Peterson (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc nc nc nc nc nc3 nc
FFFFFFFF nc nc nc nc nc nc4 nc mp nc nc nc nc nc nc5 nc mp nc nc nc nc nc nc6 nc mp nc nc nc nc nc nc7 nc mp nc nc nc nc nc nc Peterson (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TFTTTTFF TFTTTTFF -F––FF TFTT–F- FFFTFFFF -FFFF-T-
FFFFFTFT FFFFFTFT FFFFF-F- -F-F-TFT FFFFFFFF cc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF to cc -F-FF–- -F-FF–- to to to cc -F-FF-FF -F-FF-FF to to to cc cc cc cc cc to cc
Philosophers (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nf TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF cc
FTFTFFFF nf FFTFTTFT FFTFTTFT FF-F–F- FFTFTTFT FFFFFFFF TF-FF–-
FTFTFFTF nf FFFFFFF- FFFFFFF- FFFFFFF- to FFFFFFFT cc to nf cc cc cc cc FFFFTFFF cc mp nf –––F- –––F- –––F- to FFFFFFFF cc mp nf cc cc cc cc to cc to nf ––-FFF ––-FFF ––-FFF to to –––F- mp nf -F-FFFFF -F-FFFFF to to to –––T- mp nf –––F- –––F- to to to cc mp nf to to to to to to cc nf to to to to to to PhilosophersDyn (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF nc TFTFTFFF TFTFTFFF -F-F-FFF TFTFTFFF FFFTFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. mp nc TFTFFTFT TFTFFTFT -F-FF-F- TFTFFTFT to cc mp nc to to to to to to Planning (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF ––-TT-
010 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF cc FFFFFFFF cc
020 nc nc -F-FFT-T -F-FFT-T -F-FF–- to to cc
050 nc nc to to to to to cc
100 nc nc to to to to to cc
RessAllocation (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc nc
TFFFTTFF TFFFTTFF -FFF–FF TFFFT-FF FFFTFFFF cc
R003C002 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTFFFFF FFFFFFFF –––T-
R003C003 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFF-F- FFFTTFFF cc
R003C005 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TF-FFTFT FFFFFFFF cc
R003C010 nc nc
TTTTTTFT TTTTTTFT –––F- ––-TFT FFFFFFFF ––-TFT
R003C015 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- -F-FF-F- FFFFFFFF cc
R003C020 nc nc
FFFFF-FF FFFFF-FF to FFFFF–F FFFTFFFF cc
R003C050 nc nc ––FFFF ––FFFF to to FFFFTFFF –––T-
R003C100 nc nc
FFFFF-F- FFFFF-F- to to FFFFFFFF cc
R005C002 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF cc
R010C002 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- TFTFTTFT FFFFFFFF cc
R015C002 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFF-F- FFFFTFFF cc
R020C002 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- FFFFFTFT FFFTTFFF cc
R050C002 nc nc
TFTFTFFF TFTFTFFF -F-F-FFF to FFFFFFFF to
R100C002 nc nc -FFFFFFF -FFFFFFF -FFFFFFF to FFFTFFFF –––T-
Ring (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF ––-FFF
RwMutex (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTFF-F- FFFFFFFF cc r0010w0020 nc nc
TFTFTTFT TFTFTTFT -F-F–F- TFTF-TFT FFFFFFFF –––T- r0010w0050 nc nc
TTTTTTFT TTTTTTFT –––F- cc FFFFFFFF ––-TTT r0010w0100 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- cc FFFFTFFF ––-TTT r0010w0500 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF TFTF-FFF FFFTFFFF cc r0010w1000 nc nc
TFTFFTFT TFTFFTFT -F-FF-F- TFTF-TFT FFFFFFFF cc r0010w2000 nc nc
TTTTFTFT TTTTFTFT ––F-F- to to cc r0020w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF cc to cc r0100w0010 nc nc
FFFFFTFF FFFFFTFF FFFFF-FF -F-F–– cc cc r0500w0010 nc nc
TFTFFFFF TFTFFFFF -F-FFFFF -F-FFFFF cc cc r1000w0010 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF FFFFF-F- cc –––T- r2000w0010 nc nc
FFFFFTFT FFFFFTFT FFFFF-F- cc cc cc
SharedMemory (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SharedMemory (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFFFFFF nc FFFFFTFF FFFFFTFF FFFFF-FF FF––F- FFTTTFFF cc
FFFFFFFF nc FFFFFTFF FFFFFTFF FFFFF-FF to FFTTFFFF –––-T mp nc FF-FF-F- FF-FF-F- to to FFFFFFFF cc mp nc FFFFF–- FFFFF–- FFFFF–- -F-FF–- to TFTF–– mp nc cc cc cc cc to cc cc nc cc cc cc cc to cc SimpleLoadBal (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FFFFFFFF nc nc nc nc nc nc05 nc
FFFFFFFF nc nc nc nc nc nc10 nc
FFFFFFFF nc nc nc nc nc nc15 nc mp nc nc nc nc nc nc20 nc mp nc nc nc nc nc nc SimpleLoadBal (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc
TTTFTFFF TTTFTFFF –-F-FFF TTTFTTFT FFFTFFFF cc
05 nc nc
FFTFTTFT FFTFTTFT FF-F–F- FFTFT-F- FFFFFFFF –––T-
10 nc nc
FFFFFFFF FFFFFFFF FFFFFFFF cc FFFFTFFF cc
15 nc nc to to to to to cc
20 nc nc to to to to to cc
TokenRing (colored)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFFFFTF nc TFTFTTFT TFTFTTFT -F-F–F- -F-F–F- FTFFTFTF to to nc TFTFFTFT TFTFFTFT -F-FF-F- -F-F–F- FTFTFFTF cc mp nc to to to to to cc cc nc cc cc cc cc to cc “Surprise” Models Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFTFFT cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none -FFFF-F- -FFFF-F- to -FFFF–- FFFTFFFF cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FFFFFFFF FFFFFFFF FFFFFFFF FFFF-FFF FFFFFFFF cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
40 54 184 189 154 111 118 80CSRepetitions (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 0 5 5 3 3 2 3Peterson (Colored)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 5 5 3 3 2 1max reached 0 0 0 0 0 0 0 0best 0 0 2 2 0 0 0 0subtotal
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
RwMutex (P/T)
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN ITS − Tools LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 6 12 24 0HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 4 0max reached 0 0 0 0 0 0best 0 0 0 0 2 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models
LoLa opt LoLA LoLa opt inc
189 points 184 points 154 points
For “Surprise” Models
Marcie LoLa opt LoLA LoLa opt inc
24 points 12 points 12 points 12 points189 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Global
LoLa opt LoLA Marcie LoLa opt inc
213 points 208 points 166 points 166 points190 art IV
CTL-based Analysis eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
13 The CTLCardinalityComparison Examination
This examination deals with CTL properties dealing with checking cardinality of marking only. Wefirst show a summary on the handling of models by the participating tools. Then, we present the com-puted outputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s CSRepetitions (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Dekker (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
CTLCardi-nalityComparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 193 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Echo (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Eratosthenes (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 194 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s FMS (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Kanban (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
CTLCardinali-tyComparison examination. 195 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s MAPK (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s NeoElection (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination. 196 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
CTLCardinalityCompari-son examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Peterson (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Philosophers (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
CTLCardinalityComparison examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Railroad (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s RessAllocation (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Ring (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s RwMutex (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s SharedMemory (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
CTLCardinality-Comparison examination. 199 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
CTLCardinalityCompar-ison examination.
TokenRing (P/T)
No instance of this model could be computed for the
CTLCardinalityComparison examination.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s HouseConstruction (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
CTLCardinali-tyComparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for CTLCardinalityComparison : memory / / , : s e c ond s Vasy2003 (P/T) for CTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.201 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTTF?FTT F-F–T– F-F–T– cc F––T– cc cc FTTTTTTF TTF–T– TTF–T– -T–-T– TTF–T– FFFFFFFF cc to -FTF-F– -FTF-F– -FTF-F– -FTF-F– to cc to cc cc cc to to cc mp cc cc cc cc to cc mp cc cc cc cc to cc Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FT––T- FT––T- -T––T- FT––T- FFFFFFFF cc
015 nc –FT–TT –FT–TT –––T- to FFFFFFFF cc
020 nc to to to to FFFFTFFF cc
050 nc -F––F- -F––F- -F––F- to cc cc
100 nc to to to to to cc
200 nc to to to to to cc
DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
FTFTTT-F FTFTTT-F FT-TTT-F TFFTTF-T FFFTTFFF cc
10 nc cc cc cc cc FFFFFFFF cc
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc
FTFF–TF FTFF–TF FTFF–TF FTFF–TF to cc d02r11 nc -T––F- -T––F- to -T––F- cc cc d02r15 nc ––-FTT ––-FTT to to to ––-TF- d02r19 nc –––TT –––TT to to to cc d03r03 nc –––T- –––T- to to to cc d03r05 nc
FFFF–TT FFFF–TT to FFFF–– to cc d03r07 nc –-T-FTT –-T-FTT to to cc ––-TF- d04r03 nc –-F–F- –-F–F- –-F–F- –-F–F- to cc d05r03 nc ––-FF- ––-FF- to to to cc
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
TFF–-T- TFF–-T- -F––T- -F––T- cc cc
020 nc
FTT––- FTT––- FTT––- FT––– FFFTFFFF cc
050 nc ––-T– ––-T– ––-T– ––-F– FFFTFFFF cc
100 nc -T-F-F– -T-F-F– to -T––– FFFTFFFF cc
200 nc -F––– -F––– to to FFFTFFFF cc
500 nc -F––-F -F––-F to to FFFFFFFF cc
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTTFFFF –F–FFF –F–FFF ––-FFF ––-FFF FFFFFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
FTTT?FTF -TF–F-F -TF–F-F -T–-F-F ––-F-F cc cc
FTFF?TTT -F-F-T– -F-F-T– –-F-T– –-F-T– cc ––-F–
TTFT?FTF F-T––F F-T––F –––-F –––-F cc cc to –––T- –––T- to –––T- FFFFFFFF cc to –T–F-T –T–F-T –T–F-T –––-T FFFTFFFF cc to F––-F- F––-F- F––-F- F–––- to cc to –TFTT-T –TFTT-T –TFTT-T –TFT–- to cc
GlobalRessAlloc (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFTFFFF TT-T–– TT-T–– –-T–– to FFFTFFFF cc cc to to to cc to cc Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TFTTTFFF FFTT–F- FFTT–F- -FTT–F- -FTT–– FFFTTFFF cc
FFFTFTTF -F-T-F– -F-T-F– -F-T–– -F-T–– FFFFFFFF cc
FFFF?FTF -FFF–T- -FFF–T- -FFF–T- –-F–– cc cc to –-F-TFT –-F-TFT –-F-TFT –-F-TFT cc cc to –-TFT– –-TFT– –-TFT– –-TFT– FFFFTFFF cc mp –-F–FT –-F–FT –-F–FT –––F- to cc mp –––-T –––-T –––-T cc cc cc to –-T-FTF –-T-FTF –-T-FTF –-T–– to cc
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc cc cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTTTTTT –TT-FT- –TT-FT- –TT–T- –TT–T- FFTTTFFT cc
TTFFFFFT –-F–FT –-F–FT –-F–FT –––FT FFFFTFFF cc
TTTTTFFF cc cc cc cc FFFFFFFF cc to -F-F–– -F-F–– -F-F–– -F-F–– FFFFTFFF cc to -FFF-TF- -FFF-TF- -FFF-TF- -FFF-TF- to cc to -T-T-F– -T-T-F– -T-T-F– to to cc
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc –––-T –––-T cc cc FFTTFFFF cc cc cc cc cc cc cc cc cc to to to cc cc cc cc cc to cc to to to to cc to –F––- –F––- cc to cc cc
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to -T––T- -T––T- -T––T- -T––T- FFFTTFFF cc TTFFFTTT –-T–– –-T–– to to to cc FTFTTTTF -T––FF -T––FF -T––FF -T––FF to cc FFTT?FFF –-T-FT- –-T-FT- to to cc cc FTFTFTFT cc cc to to cc cc TFTTTFFF T-TF–– T-TF–– to to to cc
Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara –TF-TT- –TF-TT- –-F–T- –TF-TT- FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc –-F–– –-F–– to to to cc cc cc cc cc cc cc cc cc cc cc to cc
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTTTTTTF F–F-TTF F–F-TTF ––-TTF F–F-TTF FFFFTFFF cc
TTTTTFTF -F-F-T– -F-F-T– cc -F-F-T– FFFFTFFF cc
TTFTFTTF ––-TTF ––-TTF ––-TTF to FFFTFFFT cc to cc cc cc cc FFFTFFFF cc mp cc cc cc cc FFFFFFFF cc
FTFF cc cc cc cc FFFTTFFF cc to cc cc cc cc FFFTFFFF cc mp cc cc cc cc FFFTFFFF cc mp cc cc cc cc FFFFFFFF cc mp to to to to to to cc to to to to to to
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFT?FFT T––FFT T––FFT ––-FFT T––FFT cc cc T -T––TF -T––TF -T––TF -T––TF to cc mp to to to to to cc Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc –-F–FF –-F–FF –-F–FF –-F–FF cc cc
010 nc
T-TT–-T T-TT–-T –-T–-T T-TT–-T FFFFFFFF cc
020 nc -T-T-TTT -T-T-TTT -T-T-TTT to to cc
050 nc
T-FF–T- T-FF–T- to to to cc
100 nc –––FF –––FF –––FF to to cc
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc -TT–F-F -TT–F-F -T–-F-F -TT––F FFFFTFFF cc
R003C002 nc –-T–F- –-T–F- –-T–F- –––F- FFFFFFFF –––T-
R003C003 nc -T-T-F-T -T-T-F-T -T-T-F-T -T-T-F-T FFFTTFFF cc
R003C005 nc -F–-F– -F–-F– -F––– -F––– FFFFTFFF cc
R003C010 nc ––-T– ––-T– cc cc cc cc
R003C015 nc –-F-FT- –-F-FT- –-F-FT- –-F-FT- FFFFFFFF cc
R003C020 nc –-T-T-T –-T-T-T to –-T-T-T FFFTFFFF cc
R003C050 nc –FF-T– –FF-T– to to FFTTTFFF cc
R003C100 nc –-T–– –-T–– –-T–– –-T–– FFFFFFFF cc
R005C002 nc –-T-T-T –-T-T-T –-T-T-T –-T-T-T cc cc
R010C002 nc
F––F-T F––F-T –––-T F––F-T FFFTTFFT cc
R015C002 nc
T-F–F-F T-F–F-F –F–F-F T-F–F-F FFTTFFFF cc
R020C002 nc
TF-F–F- TF-F–F- –––F- TF-F–F- cc cc
R050C002 nc
F––-T- F––-T- F––-T- F––-T- FFFFFFFF cc
R100C002 nc –––TF –––TF to to FFFFFFFT cc
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc -T––FT -T––FT -T––FT –––FT FFFTTFFF –––T-
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc
FT-T-FTT FT-T-FTT FT-T–T- -T-T–T- FFFFFFFF cc r0010w0020 nc –FFTF-T –FFTF-T –-FT–T –-FTF– FFFFFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r0010w0050 nc
TF–-T– TF–-T– -F––– TF–-T– cc cc r0010w0100 nc
T-T–TT- T-T–TT- ––-TT- cc cc ––-FF- r0010w0500 nc –-F–F- –-F–F- –-F–F- –-F–F- FFFFFFFF cc r0010w1000 nc -F––TF -F––TF –––T- -F––TF cc cc r0010w2000 nc
F–F–T- F–F–T- –-F–T- F–F–T- cc –––F- r0020w0010 nc -F–-FT- -F–-FT- -F–-FT- -F––T- to cc r0100w0010 nc –TF-TTF –TF-TTF –––T- cc cc cc r0500w0010 nc -T–-TTF -T–-TTF -T–-TTF to cc ––-TTF r1000w0010 nc -F-F-F-F -F-F-F-F cc cc cc cc r2000w0010 nc
FFFT–F- FFFT–F- -F-T–– to cc cc
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTFTFFF T-FT-FF- T-FT-FF- –––F- cc FFFFTFFF cc
FFFF?FTF ––-T-T ––-T-T cc cc cc cc mp T-TT-TFT T-TT-TFT T-TT-TFT to cc cc mp cc cc cc cc to cc mp cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc -T––TF -T––TF –––T- -T––TF FFFFFFFF cc
05 nc -F–-TF- -F–-TF- -F––F- -F––– FFFFTFFF cc
10 nc to to to to FFFFFFFF cc
15 nc to to to to to cc
20 nc to to to to cc cc
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to ––-FFF
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none ––-TT- ––-TT- to –––T- FFFTFFFF cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FTT–F-T FTT–F-T FTT–F-T FTT–F-T FFFFTFFF cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Total Score
43 172 172 123 96 102 17CSRepetitions (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 4 8 8 7 8 3 1max reached 0 2 2 2 2 0 0best 0 2 2 2 2 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 10 10 3 3 2 0Peterson (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 6 12 22 6HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ).212 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. For “Known” Models
LoLA LoLa opt Marcie
172 points 172 points 102 points
For “Surprise” Models
Marcie LoLA LoLa opt
22 points 12 points 12 points
Global
LoLA LoLa opt Marcie
196 points 196 points 146 points 213 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
14 The CTLFireability Examination
This examination deals with CTL properties dealing with transition fireability only. We first show asummary on the handling of models by the participating tools. Then, we present the computed outputsand the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
CTLFireability exam-ination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for CTLFireability : memory / / , : s e c ond s CSRepetitions (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for CTLFireability : memory / / , : s e c ond s Dekker (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
CTLFireability exam-ination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
CTLFireabil-ity examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 214 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for CTLFireability : memory / / , : s e c ond s DrinkVendingMachine (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for CTLFireability : memory / / , : s e c ond s Echo (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for CTLFireability : memory / / , : s e c ond s Eratosthenes (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 215 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for CTLFireability : memory / / , : s e c ond s FMS (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
CTLFireability ex-amination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for CTLFireability : memory / / , : s e c ond s GlobalRessAlloc (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for CTLFireability : memory / / , : s e c ond s Kanban (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
CTLFireability examination. 216 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for CTLFireability : memory / / , : s e c ond s LamportFastMutEx (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for CTLFireability : memory / / , : s e c ond s MAPK (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
CTLFireability exami-nation.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for CTLFireability : memory / / , : s e c ond s NeoElection (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
CTLFireability examination. 217 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for CTLFireability : memory / / , : s e c ond s PermAdmissibility (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
CTLFireability examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for CTLFireability : memory / / , : s e c ond s Peterson (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
CTLFireability exami-nation.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for CTLFireability : memory / / , : s e c ond s Philosophers (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
CTLFireability ex-amination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for CTLFireability : memory / / , : s e c ond s PhilosophersDyn (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
CTLFireability examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for CTLFireability : memory / / , : s e c ond s Railroad (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for CTLFireability : memory / / , : s e c ond s RessAllocation (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for CTLFireability : memory / / , : s e c ond s Ring (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for CTLFireability : memory / / , : s e c ond s RwMutex (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
CTLFireability ex-amination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for CTLFireability : memory / / , : s e c ond s SharedMemory (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
CTLFireability ex-amination. 220 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for CTLFireability : memory / / , : s e c ond s SimpleLoadBal (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
CTLFireability examina-tion.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for CTLFireability : memory / / , : s e c ond s TokenRing (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for CTLFireability : memory / / , : s e c ond s HouseConstruction (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for CTLFireability : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
CTLFireability examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for CTLFireability : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for CTLFireability : memory / / , : s e c ond s Vasy2003 (P/T) for CTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFTTFFF FTFT–F- FTFT–F- FTFT–F- -T-T–F- FTFTTFFF TTTT–F- FTTTTTTT –F–-TT –F–-TT –––TT –F–-TT FTTTTTTT –––TF to –T–FF- –T–FF- –T–FF- to to –F–TF- to -F–-T– -F–-T– -F–-T– to to -F–-T– mp F–F–– F–F–– F–F–– cc to –-F–– mp -F––T- -F––T- to to cc -F––T- Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
F–T-T-F F–T-T-F F–T-T-F F–T-T-F FFFTTTFF cc
015 nc
T––-T- T––-T- T––-T- T––-T- cc cc
020 nc -F-T-F– -F-T-F– -F-T-F– -F-T-F– FFFTTFFF cc
050 nc -TT–F-F -TT–F-F -TT–F-F to to cc
100 nc -TT–TFT -TT–TFT -TT–TFT to to cc
200 nc to to to to to cc
DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc –FF–-T –FF–-T –FF–– –FF–-T FFFFTFTF to
10 nc cc cc cc cc FFFTF to
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. d02r09 nc
FFTT-TF- FFTT-TF- FFTT-TF- cc cc FFTTFTF- d02r11 nc –TT–– –TT–– –TT–– –-T–– to to d02r15 nc –FT-F– –FT-F– –FT-F– to to to d02r19 nc –-T-F-F –-T-F-F –-T-F-F –-T–– to to d03r03 nc
T-TT–-T T-TT–-T T-TT–-T to to T-TT–-T d03r05 nc
TF-T-T– TF-T-T– TF-T-T– to to TF-T-T– d03r07 nc
FTT–T-T FTT–T-T FTT–T-T to cc to d04r03 nc
FT-T–– FT-T–– FT-T–– -T-T–– cc FT-T–– d05r03 nc
FTTT–T- FTTT–T- FTTT–T- to to to
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc –F-TF-F –F-TF-F –F-TF-F –F-TF-F FTFTTFFF –T-TF-F
020 nc
F-FF–T- F-FF–T- F-FF–T- F-FF–T- FFFFFTTF F-TT–T-
050 nc -FT–T-T -FT–T-T -FT–T-T -FT–T-T FFTTFTFT -FT–T-T
100 nc
FFT–-TT FFT–-TT FFT–-TT FFT–-TT FFTTFTTT FFT–-TT
200 nc -F-T-T– -F-T-T– -F-T-T– -F-T-T– TFFTTTFF -F-F-T–
500 nc
FFF–F-T FFF–F-T FFF–F-T FFF–F-T FFFTFFTT FFF-TF-T
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFT?FFF -TFT–– -TFT–– -TFT–– -TTT–– cc -TFTF–-
FTTTFFFT -T––-T -T––-T -T––-T -T––– FTFTTFTT -T––-T
FFTFTTTT F-TF-T-T F-TF-T-T F-TF-T-T cc FFTFFTTT F-TFFT-T
FTFT?TTF -T–-TT- -T–-TT- -T–-TT- -T–-TT- cc -T–-TT-
TTFT?FFF T–T-FF- T–T-FF- T–T-FF- –-T–F- cc T–T-FF-
FFFTFTTF FF-T–-F FF-T–-F FF-T–-F -F-T–-T FFFTFFFF FF-T–-F to T–F–– T–F–– T–F–– –-F–– to T–FT–- to –F–-F- –F–-F- –F–-F- –––F- to –F–-F-
GlobalRessAlloc (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara TFTFTFTF T-FF-FT- T-FF-FT- T–F-FT- to TTTFTFTF to cc cc cc cc cc to cc Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFTT?TFT -FT–TFT -FT–TFT -FT–TFT -F––– cc -FT–TFT
FFFT?FFF FF–-FF- FF–-FF- FF–-FF- FF––– cc FF–TFF-
FTFTTFFF FT-T-F– FT-T-F– FT-T-F– ––-F– FTFTFFTF FT-T-F– to -FF–TF- -FF–TF- -FF–TF- cc FFFFFTFT -FF-FTF-
FFTT?FFF –T––- –T––- –T––- cc cc –T––- mp FF-F–TT FF-F–TT FF-F–TT -F-F–– to FF-FF-TT
FFF -TTF–– -TTF–– -TTF–– cc to -TTF–– to FT–-TF- FT–-TF- FT–-TF- FT––– cc FT–-TF-
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc cc cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFTTTFTF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFTFFFF –F–F-F –F–F-F –F–F-F –F–F-F FFFTFFFF –F-FF-F
FTTT?FTF -TT–-T- -TT–-T- -TT–-T- -TT–-T- cc -TT-T-T- to TFFT–F- TFFT–F- TFFT–F- FFTT–F- TFFTFFFF to to -FT–-FT -FT–-FT -FT–-FT to FFTFTFFT -FT–-FT to –––TF –––TF –––TF –––TF to –––TF to T–-F–F T–-F–F T–-F–F to to T–-F–F
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara –FF–T- –FF–T- –-F–T- –FF–T- cc –FTF-F-
T–F-TFF T–F-TFF –––F- T–F-TFF FFFFFFFF T–F-TTF to to to to to -FT-T–- -T–-F– -T–-F– -T–-F– to cc -F–-T– -T–-TT- -T–-TT- to to to -F–-FF- to to to to cc –F-TT-F to to to to cc –––FT
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to F–FT–T F–FT–T –-F–– F–FT–T FFTFFFTF F–-T–T FFFTFFFF FF–-F– FF–-F– FF–-F– to to FF–-F– FTFFTFTF T–F-F-T T–F-F-T T–F-F-T to to to FTFT?FFF F-T–TF- F-T–TF- F-T–TF- to cc F-T–TF- FFFFFFTF T-F––- T-F––- T-F––- to cc to FFTFTTFF -T-T–T- -T-T–T- -T-T–T- -T-T–T- cc -T-T–T-
Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. -TTF–T- -TTF–T- -T-F–T- -T-F–T- cc -TFF–T- -F–-F-F -F–-F-F -F–-F-F -F–-T-T cc to ––-F– ––-F– ––-F– ––-F– cc ––-T– cc cc to to to F-F––-
T–F-FT- T–F-FT- to to to to –T–FT- –T–FT- –T–FT- –T–FT- to cc
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTF?FTF –T–-T- –T–-T- –T–-T- –T–-T- cc –F-T-T-
TTTT?TTT –TT–– –TT–– –TT–– –TT–– cc –FTF–-
FTTF?TTF FT-F-TTF FT-F-TTF FT-F-TTF FT-F-TTF cc TT-F-FTT mp -TFF–FF -TFF–FF -TFF–FF -TFF–FF FTFFFFFF -TTF–FT mp -FF–F– -FF–F– -FF–F– to to -F––– mp F––T-F F––T-F F––T-F to cc cc to FFTT-FT- FFTT-FT- FFTT-FT- to to -F-T–T- mp -F–-FT- -F–-FT- -F–-FT- to to cc mp F-TT–T- F-TT–T- F-TT–T- to cc cc mp TT-F–TF TT-F–TF TT-F–TF to to cc cc ––-F– ––-F– ––-F– to to cc
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara TTFFFFFF TT–-F– TT–-F– TT–-F– TT–-F– TTFTFFFT -T–-T– FFF –-T-T– –-T-T– –-T–– –-T-T– to ––-T– mp to to to to to cc Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc –TF–-T –TF–-T –TF–– –TF–-T cc –TF–-F
010 nc
FFF–F-T FFF–F-T -F–-F-T cc cc to
020 nc –-F–T- –-F–T- –-F–T- cc to –-F–T-
050 nc to to to to to to
100 nc to to to to to to
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc ––-F-T ––-F-T cc ––-F-T FTFTTFTF ––-F-F
R003C002 nc
T-FT-TT- T-FT-TT- –-T–T- ––-TT- FFTTFFTF T-TTTTT- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
R003C003 nc
T-FT-F-F T-FT-F-F T-FT-F-F T-FT-F-F TTFTTFTF T-FTTF-F
R003C005 nc -TFF-F-F -TFF-F-F -T-F–– -T-F-F-F FTFFTFFF to
R003C010 nc
T-T–TFT T-T–TFT ––-TFT T-T–TFT FFFFFTFT T-T-FTFT
R003C015 nc
TTF–TF- TTF–TF- TTF–TF- FTT–TF- TTFTTTFT TTF–TF-
R003C020 nc
FFTT-TFT FFTT-TFT FFTT-TFT FFTT-TFT FFTTFTFT FFTT-TFT
R003C050 nc
FT-T-T– FT-T-T– FT-T-T– to to FT-TTT–
R003C100 nc
FFTFTFT- FFTFTFT- FFTFTFT- to FFTFTFTF FFTFTFT-
R005C002 nc –––F- –––F- –––F- –––F- FFFTTFFF ––T-F-
R010C002 nc
F-TT–-F F-TT–-F –-T–-F F-TT–-F FTFTFFFF F-FT–-F
R015C002 nc -FF–F-T -FF–F-T -FF–F-T -FF–F-T FFFFTFFT -FF-TF-T
R020C002 nc
T––-FF T––-FF –––FF T––-FT FFFFFFFF to
R050C002 nc
F-F––- F-F––- cc to cc to
R100C002 nc cc cc cc cc to ––T–-
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc -T––-T -T––-T -T––-T to FTFFFFFT -T––-F
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc -TTF–TF -TTF–TF -TTF–T- -T-F–TF cc -TTF–TF r0010w0020 nc –––-T –––-T cc –––-T TTFTTFTF –––-F r0010w0050 nc
T-FF-T-F T-FF-T-F –-F-T-F T-FF-T-F FTTFFTFF T-FF-T-F r0010w0100 nc
FF-F–FF FF-F–FF -F-F–F- cc FFFFFFFT FF-FT-FT r0010w0500 nc
F––-F- F––-F- –––F- F––-F- cc F––-F- r0010w1000 nc
T-T-FF-T T-T-FF-T cc T-T-FF-T FTFTTFFF T-T-TF-T r0010w2000 nc
F–F–F- F–F–F- –-F–F- to to F–FT-F- r0020w0010 nc
T–T–– T–T–– T–T–– T–T–– to T–T–– r0100w0010 nc -TFT-TT- -TFT-TT- -TFT-TT- -T-T–T- cc -TFTTTT- r0500w0010 nc -F-T–– -F-T–– -F-T–– -F-T–– cc -F-TT–- r1000w0010 nc
F–T-FTT F–T-FTT F–T-FTT –––T- cc F–T-FTT r2000w0010 nc ––-FTT ––-FTT ––-FTT cc cc ––TFTT
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFT?TTT –T––F –T––F cc cc cc –T––-
FTFT?TTT -TFF-F– -TFF-F– -TFF-F– -T-F–– cc -TTF-T– mp -F-F–F- -F-F–F- -F-F–F- -F-F–F- cc -F-FT-F- mp TTT––- TTT––- to to to cc mp -F––-T -F––-T to to to cc cc cc cc cc cc to cc
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc –-F-F– –-F-F– –-F-F– –-F–– FFFFTFTT –-F-F–
05 nc
TF–-F– TF–-F– TF–-F– -F–-F– cc F––T–
10 nc
FT-F–– FT-F–– to FT-F–-F cc to
15 nc
FT-T–FT FT-T–FT FT-T–FT to to to
20 nc to to to to to to
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTFTFTF -T––FT -T––FT -T––F- -T––F- FTTFTFTF to to ––-T– ––-T– cc cc FTFTTFTF cc mp to to to to to cc cc cc cc cc cc to cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc TFTFFFFT cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFTFFFTF cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
F-FT-F-F F-FT-F-F F-FT-F-F T-TT-T-T to cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFTTFFFT cc cc cc cc cc FFFTFTTF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none -T––– -T––– -T––– to FTFTTFFF -TT-T–- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
47 198 198 178 113 83 152CSRepetitions (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 2 6 6 6 4 3 5max reached 0 2 2 2 0 0 2best 0 2 2 2 0 0 2subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 11 11 11 7 2 9Peterson (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 2 2 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 12 6 17 6HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models
LoLA LoLa opt LoLa opt inc
198 points 198 points 178 points
For “Surprise” Models
Marcie LoLA LoLa opt
17 points 12 points 12 points
Global
LoLA LoLa opt LoLa opt inc
222 points 222 points 202 points 234 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
15 The CTLMarkingComparison Examination
This examination deals with CTL properties dealing with marking comparison only. We first show asummary on the handling of models by the participating tools. Then, we present the computed outputsand the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
CTLMarkingCompar-ison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for CTLMarkingComparison : memory / / , : s e c ond s CSRepetitions (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
No instance of this model could be computed for the
CTLMarkingComparison exam-ination.
DotAndBoxes (colored)
No instance of this model could be computed for the
CTLMarkingCompar-ison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
CTLMark-ingComparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for CTLMarkingComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
No instance of this model could be computed for the
CTLMarkingComparison exami-nation. 235 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Eratosthenes (P/T)
No instance of this model could be computed for the
CTLMarkingComparison examination.
FMS (P/T)
No instance of this model could be computed for the
CTLMarkingComparison exami-nation.
GlobalRessAlloc (colored)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for CTLMarkingComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
No instance of this model could be computed for the
CTLMarkingComparison ex-amination.
LamportFastMutEx (colored)
No instance of this model could be computed for the
CTLMarking-Comparison examination.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for CTLMarkingComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
No instance of this model could be computed for the
CTLMarkingComparison exam-ination.
NeoElection (colored)
No instance of this model could be computed for the
CTLMarkingCompari-son examination. 236 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for CTLMarkingComparison : memory / / , : s e c ond s NeoElection (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for CTLMarkingComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
CTLMarkingComparison examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for CTLMarkingComparison : memory / / , : s e c ond s Peterson (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (colored)
No instance of this model could be computed for the
CTLMarkingCompari-son examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for CTLMarkingComparison : memory / / , : s e c ond s Philosophers (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for CTLMarkingComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
CTLMarkingComparison ex-amination.
Railroad (P/T)
No instance of this model could be computed for the
CTLMarkingComparison ex-amination.
RessAllocation (P/T)
No instance of this model could be computed for the
CTLMarkingCompari-son examination.
Ring (P/T)
No instance of this model could be computed for the
CTLMarkingComparison exami-nation.
RwMutex (P/T)
No instance of this model could be computed for the
CTLMarkingComparison ex-amination.
SharedMemory (colored)
No instance of this model could be computed for the
CTLMarkingCom-parison examination. 238 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for CTLMarkingComparison : memory / / , : s e c ond s SharedMemory (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for CTLMarkingComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
CTLMarkingComparison examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for CTLMarkingComparison : memory / / , : s e c ond s TokenRing (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
HouseConstruction (P/T)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
IBMB2S565S3960 (P/T)
No instance of this model could be computed for the
CTLMarkingCom-parison examination.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
CTLMarking-Comparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for CTLMarkingComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for CTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
No instance of this model could be computed for the
CTLMarkingComparison ex-amination.
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc -F-F-TF- -F-F-TF- -F-F–F- -F-F-TF- cc -F-F-TT- cc -F-T-T– -F-T-T– -F-T-T– -F-T-T– FFFTTFFF -F-F-T– cc cc cc cc to cc -FT–T– to TT––T- TT––T- to to to TT–-TFF cc -T-T–-F -T-T–-F -T-T–-F cc to -T-T–-F mp ––-TT- ––-TT- to to to –-TTTT- Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nf nf nf nf nf nf nf015 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf
DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc –TT-TFF –TT-TFF –-T–FF –TT–FF FFFFTFFF to
10 nc cc cc cc cc FFFFFFFF to
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nf nf nf nf nf nf nfd02r11 nf nf nf nf nf nf nfd02r15 nf nf nf nf nf nf nfd02r19 nf nf nf nf nf nf nfd03r03 nf nf nf nf nf nf nfd03r05 nf nf nf nf nf nf nfd03r07 nf nf nf nf nf nf nfd04r03 nf nf nf nf nf nf nfd05r03 nf nf nf nf nf nf nf
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
002 nf nf nf nf nf nf nf005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc FT––– FT––– -T––– to FFFFFFFT F–––- cc to to to –T––- cc to Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc cc FF–FF-T cc cc cc cc cc –FT-TFT cc cc cc cc FFFFTFFF –TT-FT- cc cc cc cc to T-TT–F- cc cc cc cc cc -T–-TFT cc cc cc cc to T–T-T-T cc cc cc cc to –T–-TT
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
008 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf040 nf nf nf nf nf nf nf080 nf nf nf nf nf nf nf160 nf nf nf nf nf nf nf320 nf nf nf nf nf nf nf
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara -T-TT-F- -T-TT-F- –-TT-F- -T-TT-F- FFFTTFFF -T-FF-F- eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
TTFF–F- TTFF–F- cc TTFF–F- FFFFFFFF TTFF–F- -F––-T -F––-T to to cc -TT–-TF to to to to to FF–-TT- to to to to to FT-FFT-F -F––TF -F––TF cc to to cc to to to to to -T-F–-F
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc -T-TFT-F -T-TFT-F –-T–-F -T-TFT-F FFFTFFFF -T-FFF-T ?????TFF -T-T–– -T-T–– -T-T–– -T-T–– to -T-T–– FTTTFTTT -T––– -T––– -T––– -T––– to -T––– TFTT???? –––T- –––T- to to cc –––TF cc -F––-F -F––-F to to cc FF––-F FTTFT??? –-T–F- –-T–F- to to to T–T–FT
Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF cc
FT––– FT––– -T––– FT––– cc FF––– –––T- –––T- to to to –TFFTF- –-F–– –-F–– to to to F–T-F-F cc cc to to cc to cc cc to to to –T–T-F
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara ?????FFF FFFT–– FFFT–– FFFT–– FFFT–– FFFTFFFF FFTF–– cc –-F-FTT –-F-FTT –-F–T- –-F-FTT FFFTTFFF to cc -F––– -F––– -F––– to FFFFTFFF -FF-T–- cc –-T-FF- –-T-FF- –-T-FF- to FFFFFFFF F–T-FF- cc –-F–– –-F–– –-F–– to FFTTFFFF –-T-F– eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc –-T–– –-T–– –-T–– to FFTTTFFF T–F–-F to –-T–T- –-T–T- –-T–T- to FFFFTFFF –TT–FF mp –––F- –––F- –––F- to cc -T––F- mp –-T–T- –-T–T- –-T–T- to cc cc mp -T-F-F-T -T-F-F-T -T-F-F-T to to cc cc -T––– -T––– -T––– to to cc
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc F-F–TFF F-F–TFF –––F- F-F–TFF FFFTTFFF –T–TTF cc T––FTT T––FTT cc T––FTT to to mp to to to to cc to Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nf nf nf nf nf nf nfR003C002 nf nf nf nf nf nf nfR003C003 nf nf nf nf nf nf nfR003C005 nf nf nf nf nf nf nfR003C010 nf nf nf nf nf nf nfR003C015 nf nf nf nf nf nf nfR003C020 nf nf nf nf nf nf nfR003C050 nf nf nf nf nf nf nfR003C100 nf nf nf nf nf nf nfR005C002 nf nf nf nf nf nf nfR010C002 nf nf nf nf nf nf nfR015C002 nf nf nf nf nf nf nfR020C002 nf nf nf nf nf nf nfR050C002 nf nf nf nf nf nf nfR100C002 nf nf nf nf nf nf nf
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf nf
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nf nf nf nf nf nf nfr0010w0020 nf nf nf nf nf nf nfr0010w0050 nf nf nf nf nf nf nfr0010w0100 nf nf nf nf nf nf nfr0010w0500 nf nf nf nf nf nf nfr0010w1000 nf nf nf nf nf nf nfr0010w2000 nf nf nf nf nf nf nfr0020w0010 nf nf nf nf nf nf nfr0100w0010 nf nf nf nf nf nf nfr0500w0010 nf nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 nf nf nf nf nf nf nfr2000w0010 nf nf nf nf nf nf nf
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc T-F––T T-F––T –––-T cc cc F-T––F cc F––TT- F––TT- –––T- –––T- cc T–-TTF- mp –––TF –––TF to to cc F-T–-TF mp –––FT –––FT to to cc –––FT mp to to to to to cc cc cc cc cc cc cc to
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
T–––- T–––- T–––- T–––- cc T–-T–-
05 nc -F-T–– -F-T–– -F-T–– -F-T–– FFFTTFFF to
10 nc to to to to FFFFFFFF to
15 nc to to to to cc –T-TFFT
20 nc to to to to to -T–-T–
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara ?????FFT –-F-FFT –-F-FFT –––FT –-F-FFT FFFFTFFF –-F–-T cc FTTT-T-F FTTT-T-F ––-T-F FTTT-T-F FFFFTFFF TTFT-T-F mp –––-F –––-F –––-F –––-F to –––-F cc to to to to to cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
002 nf nf nf nf nf nf005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFF ––-FF- cc cc cc cc FFFFFFFF T-TTF–F cc cc cc cc to –-T–T- cc cc cc cc to -FT–T– cc cc cc cc cc -FFF-T– cc cc cc cc cc -FTF–– cc cc cc cc cc TT–-TT- Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nf nf nf nf nf nf
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
13 71 71 46 39 36 87CSRepetitions (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Sara LoLA LoLa opt
87 points 71 points 71 points
For “Surprise” Models
Sara Marcie
12 points 3 points
Global
Sara LoLA LoLa opt
111 points 71 points 71 points 252 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
16 The CTLPlaceComparison Examination
This examination deals with CTL properties dealing with the comparison of places marking only. Wefirst show a summary on the handling of models by the participating tools. Then, we present the com-puted outputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
CTLPlaceComparison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for CTLPlaceComparison : memory / / , : s e c ond s CSRepetitions (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Dekker (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
CTLPlaceComparison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
CTLPlace-Comparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 253 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for CTLPlaceComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Echo (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Eratosthenes (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 254 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for CTLPlaceComparison : memory / / , : s e c ond s FMS (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
CTLPlaceCompar-ison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for CTLPlaceComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Kanban (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
CTLPlaceCom-parison examination. 255 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for CTLPlaceComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for CTLPlaceComparison : memory / / , : s e c ond s MAPK (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
CTLPlaceComparison examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for CTLPlaceComparison : memory / / , : s e c ond s NeoElection (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
CTLPlaceCom-parison examination. 256 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for CTLPlaceComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
CTLPlaceComparison ex-amination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Peterson (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
CTLPlaceComparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Philosophers (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
CTLPlaceCompar-ison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for CTLPlaceComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
CTLPlaceComparison exami-nation.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Railroad (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for CTLPlaceComparison : memory / / , : s e c ond s RessAllocation (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Ring (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for CTLPlaceComparison : memory / / , : s e c ond s RwMutex (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
CTLPlaceCompari-son examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for CTLPlaceComparison : memory / / , : s e c ond s SharedMemory (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
CTLPlaceCompari-son examination. 259 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for CTLPlaceComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
CTLPlaceComparison examination.
TokenRing (P/T)
No instance of this model could be computed for the
CTLPlaceComparison ex-amination.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for CTLPlaceComparison : memory / / , : s e c ond s HouseConstruction (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for CTLPlaceComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
CTLPlaceCom-parison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for CTLPlaceComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for CTLPlaceComparison : memory / / , : s e c ond s Vasy2003 (P/T) for CTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.261 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFFFFFF TFT-F–- TFT-F–- -F–F–- ––F–- FFFFTFFF cc FTFTFFFF –T––- –T––- cc –T––- FFFTTFFF cc FFFT?FTF –-T–– –-T–– –-T–– to cc cc to cc cc to to cc cc mp ––-FT- ––-FT- to to cc cc mp -F––– -F––– to to to cc Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
F––TFT F––TFT ––-TFT F––TFT cc cc
015 nc
T-T––- T-T––- –T––- T-T––- cc cc
020 nc -T-F–FT -T-F–FT -T-F–F- to FFFFTFFF cc
050 nc –-F-F– –-F-F– –-F-F– –-F-F– to cc
100 nc to to to to to cc
200 nc –TT–F- –TT–F- nf to to cc DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
TTTT–– TTTT–– cc TTTT–– FFFFFFFF cc
10 nc cc cc cc cc FFFFFFFF cc
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc –––-F –––-F –––-F cc to cc d02r11 nc
T-F––- T-F––- to T-F––- to cc d02r15 nc cc cc to to to cc d02r19 nc ––-T– ––-T– to ––-T– to ––-F– d03r03 nc
F––TTF F––TTF F––-T- to to cc d03r05 nc –-T–-F –-T–-F –-T–-F –-T–– to cc d03r07 nc -F–-TF- -F–-TF- -F–-TF- to to cc d04r03 nc –F––- –F––- to –F––F cc cc d05r03 nc –F–T– –F–T– –F–T– –F–T– cc cc
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
F–––F F–––F cc cc FFFFFFFF cc
020 nc –T–-F- –T–-F- –––F- –––F- FFFTFFFF –––T-
050 nc
FTF––- FTF––- to FTF–T– FFFFFFFF ––-T–
100 nc –––-F –––-F –––-F –––-F FFFFTFFF cc
200 nc –––T- –––T- to to FFFFFFFF ––-TF-
500 nc -TT–TFF -TT–TFF to to cc cc
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFT?FFT -T-T–-T -T-T–-T -T-T–-T –-T–– cc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
FTFFTTTT –-T-F-F –-T-F-F cc cc FFFFFFFF cc
FFFTTTTF TFTT-TT- TFTT-TT- -F-T-TT- -F-T–T- FFFFFFFF cc
FFFFFTTF T–F–-T T–F–-T –-F–– –-F–– FFFTTFFF cc
FTFFTFTF FT––T- FT––T- FT––T- FT––T- FFTTTFFT –––F- mp ––-TFT ––-TFT ––-TFT ––-TFT FFFFFFFF cc to –––-F –––-F –––-F cc cc –––-T to cc cc cc cc to cc
GlobalRessAlloc (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFFFTTF –-F-TT- –-F-TT- –-F-TT- to FFFFFFFF to cc to to to cc to cc Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFTTTTF T––T-F T––T-F ––-T-F ––-T-F FFFTTFFF cc
FTFFFTFF –-F-TF- –-F-TF- –-F-TF- –-F–F- FFFFFFFF cc
TTFTFTTF ––-T-F ––-T-F ––-T-F ––-T-F FFFTTFFF cc to –––T- –––T- –––T- cc FFFFFFFF cc to -F-F–F- -F-F–F- -F-F–F- –––F- cc cc
TTF –TT-T– –TT-T– –TT-T– –-T–– to cc mp -F––– -F––– -F––– -F––– to cc to –TT–T- –TT–T- –TT–T- –TT–– to cc
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTFT?FTF –T–-TF –T–-TF –––TF –––TF cc –––F-
FFTTTFTF –––T- –––T- –––T- –––T- FFTTTFFT cc to -T-T–F- -T-T–F- -T-T–F- –-T–F- FFTTFFFF cc to FTF––- FTF––- FTF––- to FFFFFFFF cc to ––-TT- ––-TT- ––-TT- ––-TT- to cc to –-F–FT –-F–FT –-F–FT to to cc
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara -TF–T– -TF–T– -T––– -TF––- FFFFFFFF cc -TF–FTT -TF–FTT –––T- -TF–FTT FFFTFFFF cc –-T-FF- –-T-FF- –-T-FF- –-T-FF- cc ––-TT- ––-FFT ––-FFT to to to cc -TFT–T- -TFT–T- to to to cc –-T–-T –-T–-T –-T–-T –-T–-T to cc –-F–T- –-F–T- –-F–T- –-F–T- cc cc
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc T––FT- T––FT- T––-T- T––FT- cc cc cc ––-F– ––-F– ––-F– ––-F– to cc TFFFFTTF ––-F-F ––-F-F to to to cc TFFT?TFF –-T–T- –-T–T- to to cc –––F- cc -F––T- -F––T- -F––T- –––T- to cc FTFFT??? -F–-F-T -F–-F-T to to cc cc
Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara ––-T– ––-T– cc cc cc ––-T– -T–-TFF -T–-TFF -T––FF -T––F- cc cc cc cc to to cc cc ––-TF- ––-TF- to to to cc cc cc to to to cc –-T-F– –-T-F– to to to cc
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFF?FFF F–F-F– F–F-F– F–F–– F–––- cc cc
FFTTTFTF T–F–T- T–F–T- –––T- –––T- FFFFTFFF cc
FFFF?FTT –––T- –––T- –––T- to cc cc to -F––– -F––– -F––– to FFFFFFFF cc to -FTF–– -FTF–– -FTF–– to FFFFFFFF cc
FFFTF –––T- –––T- –––T- to FFFFTFFF cc to cc cc cc to FFFFFFFF cc mp –––T- –––T- –––T- to FFFTTFFT cc mp –––-T –––-T –––-T to to cc mp ––-TTF ––-TTF to to to cc cc –––T- to to to to cc
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFT?FTF -T––T- -T––T- -T––T- -T––T- cc cc mp T-FT-T-T T-FT-T-T –-T–– T-FT-T-T to cc mp to to to to cc cc Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc –-F-T– –-F-T– –-F-T– –-F-T– FFFFTFFF cc
010 nc ––-T-T ––-T-T cc cc FFFFFFFF cc
020 nc ––-T– ––-T– ––-T– to to cc
050 nc –-F-FT- –-F-FT- to to to cc
100 nc to to to to to cc
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc –––T- –––T- –––T- –––T- FFFTFFFF cc
R003C002 nc
FT-T-F-F FT-T-F-F -T-T-F-F FT-T–-F FFFFFFFT ––-T–
R003C003 nc –F––- –F––- cc cc FFFFTFFF cc
R003C005 nc –F–-TT –F–-TT –––TT –F–-TT cc cc
R003C010 nc -T-T–– -T-T–– cc cc FFFFFFFT cc
R003C015 nc –FT-F– –FT-F– –-T-F– –-T-F– FFFTTFFF cc
R003C020 nc cc cc cc cc FFFTTFFF cc
R003C050 nc cc cc to to cc cc
R003C100 nc –––-F –––-F to to FFFTFFFF cc
R005C002 nc
T-FF-F-T T-FF-F-T ––-F-T ––-F-T FFFFTFFF cc
R010C002 nc -F-F-FTF -F-F-FTF -F-F–– -F-F–-F FFTTTFFF cc
R015C002 nc
FT-F-TT- FT-F-TT- FT-F-TT- FT-F-TT- cc cc
R020C002 nc
T––-F- T––-F- –––F- T––-F- cc cc
R050C002 nc –TT–T- –TT–T- –TT–T- –TT–T- FFFFFFFF cc
R100C002 nc cc cc to cc cc cc
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc -F–-F-T -F–-F-T -F–-F-T to cc cc
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc
F–T-F– F–T-F– F–T–– F–T–– FFFFFFFF cc r0010w0020 nc –-F-T-F –-F-T-F –-F-T-F –-F-T– FFTTFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r0010w0050 nc –F–FFF –F–FFF ––-FFF –F–FFF FFFFFFFF cc r0010w0100 nc
F-F–T-T F-F–T-T cc cc FFFFTFFF cc r0010w0500 nc –TT–F- –TT–F- –TT–– –TT–F- FFTTFFFF cc r0010w1000 nc -F-F-F-T -F-F-F-T -F-F-F-T -F-F-F-T FFFFTFFF cc r0010w2000 nc –T–-T- –T–-T- cc to to cc r0020w0010 nc -FF–-T- -FF–-T- –––T- cc FFFFFFFF cc r0100w0010 nc -T–-TFT -T–-TFT -T–-TFT -T––F- cc ––-FTF r0500w0010 nc
TFTF–-T TFTF–-T –––-T cc cc cc r1000w0010 nc
F-T–FT- F-T–FT- –––T- –––T- cc cc r2000w0010 nc –-T-FFT –-T-FFT –-T-FFT cc cc cc
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFTTFFF TF-T-TT- TF-T-TT- -F-T–– cc FFFFFFFF cc
FTFFTFTT –FF–-T –FF–-T –-F–-T –-F–– FFFFTFFF cc mp cc cc to to cc cc mp cc cc to to cc ––-F– mp to to to to to cc cc cc cc cc cc to –––-F
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc
F–T-FT- F–T-FT- –-T-FT- F–T-FT- FFTTFFFF cc
05 nc –TT–T- –TT–T- –-T–T- –TT–– FFFFFFFF cc
10 nc to to to to FFFFFFFF cc
15 nc to to to to to cc
20 nc
T––TFF T––TFF T––TFF T–––- to cc
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf100 nf nf nf nf nf nf nf200 nf nf nf nf nf nf nf500 nf nf nf nf nf nf nf
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nf nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
010 nf nf nf nf nf nf nf020 nf nf nf nf nf nf nf050 nf nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFFFFF –––-F cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc –––T- cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none cc cc to cc FFFTTFFF cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFFFFT cc cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none –––FT –––FT –––FT to FFFFFFFF cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Total Score
40 192 187 135 102 84 30CSRepetitions (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 5 7 7 6 5 5 2max reached 0 0 0 0 0 0 0best 0 2 2 2 0 0 2subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0 0best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ).272 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. For “Known” Models
LoLA LoLa opt LoLa opt inc
192 points 182 points 135 points
For “Surprise” Models
Marcie LoLA LoLa opt LoLa opt inc
22 points 6 points 6 points 6 points
Global
LoLA LoLa opt LoLa opt inc
204 points 199 points 147 points 273 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
17 The CTLMix Examination
This examination deals with CTL properties dealing with all the previous type of atomic proposi-tion. We first show a summary on the handling of models by the participating tools. Then, we presentthe computed outputs and the associated scores for this examination prior to a summary of relevantexecutions.
CSRepetitions (colored)
No instance of this model could be computed for the
CTLMix examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for CTLMix : memory / / , : s e c ond s CSRepetitions (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for CTLMix : memory / / , : s e c ond s Dekker (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
CTLMix examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
CTLMix ex-amination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 274 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for CTLMix : memory / / , : s e c ond s DrinkVendingMachine (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for CTLMix : memory / / , : s e c ond s Echo (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for CTLMix : memory / / , : s e c ond s Eratosthenes (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 275 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for CTLMix : memory / / , : s e c ond s FMS (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
CTLMix examina-tion.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for CTLMix : memory / / , : s e c ond s GlobalRessAlloc (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for CTLMix : memory / / , : s e c ond s Kanban (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
CTLMix exami-nation. 276 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for CTLMix : memory / / , : s e c ond s LamportFastMutEx (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for CTLMix : memory / / , : s e c ond s MAPK (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
CTLMix examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for CTLMix : memory / / , : s e c ond s NeoElection (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
CTLMix exami-nation. 277 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for CTLMix : memory / / , : s e c ond s PermAdmissibility (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
CTLMix examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for CTLMix : memory / / , : s e c ond s Peterson (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
CTLMix examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for CTLMix : memory / / , : s e c ond s Philosophers (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
CTLMix examina-tion. 278 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for CTLMix : memory / / , : s e c ond s PhilosophersDyn (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
CTLMix examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for CTLMix : memory / / , : s e c ond s Railroad (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for CTLMix : memory / / , : s e c ond s RessAllocation (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 279 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Ring (P/T) for CTLMix : memory / / , : s e c ond s Ring (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for CTLMix : memory / / , : s e c ond s RwMutex (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
CTLMix examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for CTLMix : memory / / , : s e c ond s SharedMemory (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
CTLMix examination.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 280 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SimpleLoadBal (P/T) for CTLMix : memory / / , : s e c ond s SimpleLoadBal (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
CTLMix examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for CTLMix : memory / / , : s e c ond s TokenRing (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for CTLMix : memory / / , : s e c ond s HouseConstruction (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). 281 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s IBMB2S565S3960 (P/T) for CTLMix : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
CTLMix exam-ination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for CTLMix : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for CTLMix : memory / / , : s e c ond s Vasy2003 (P/T) for CTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: 282 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc03 nc nc nc nc nc nc nc04 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFTFFFF –-T–-F –-T–-F –-T–-F cc FFFTTFFF cc FFFTFTTT FF-T-FTF FF-T-FTF FF-T–T- TF-T–– FFFTFFTF cc to -F-T–– -F-T–– -F-T–– to to cc to -FT––- -FT––- -FT––- to to -F––– mp cc cc cc cc to cc mp cc cc cc cc to cc Dekker (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
FTTT–-T FTTT–-T -T-T–-T FTTT–-T FFFFTFFT cc
015 nc
T––FFT T––FFT –––FT T––FFT FFFFFFFF cc
020 nc -FTT-FT- -FTT-FT- -F-T-FT- to cc cc
050 nc
FFTT–F- FFTT–F- FFTT–F- to cc cc
100 nc
T-T–-F- T-T–-F- T-T–-F- to to cc
200 nc to to to to to cc
DotAndBoxes (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
DrinkVendingMachine (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc ––-FTF ––-FTF cc ––-FTF FFFTFFFF cc
10 nc cc cc cc cc to cc
Echo (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara d02r09 nc
T–T–-F T–T–-F to T–T–-F to cc d02r11 nc -F–-T– -F–-T– -F–-T– -F––– cc cc d02r15 nc –-F–– –-F–– to -T-F–– cc cc d02r19 nc -T–-FT- -T–-FT- to -T–-FT- to ––-TF- d03r03 nc –F––- –F––- –F––- –F––- to cc d03r05 nc –-F–– –-F–– to –-F–– cc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. d03r07 nc –-T-TF- –-T-TF- –-T-TF- to to to d04r03 nc -F-F-FFT -F-F-FFT -F-F-FFT -F-F-FFT to cc d05r03 nc –-F–– –-F–– –-F–– –-F–– to to
Eratosthenes (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
010 nc
TTTT-F-F TTTT-F-F TTTT–– TTTT-F-F FTFTFFTF ––-F-F
020 nc
F–T–– F–T–– F–T–– F–T–– FFFFFFFF cc
050 nc –TT-TT- –TT-TT- –TT-TT- –TT-TT- FFFFTFFF cc
100 nc –-F–– –-F–– –-F–– –-F–– FFFFTFTF cc
200 nc –TF–-F –TF–-F –TF–-F to FFTTFFTF –––-T
500 nc –-F-TF- –-F-TF- to to to cc
FMS (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
TTFTTFTF T––-T- T––-T- T––-T- T––-T- FFFFTFTF –––F-
FFFTTTTF -F-T–-T -F-T–-T -F-T–– -F-T–– FFFTFFTF cc
TTTTFFFF FF–-FF- FF–-FF- ––-FF- cc FFFTTFFF cc
FFTFTTTF -FT–TT- -FT–TT- -FT–TT- -FT–-T- FFFFTFTF cc
TFFFTFFF TFFF–F- TFFF–F- TFFF–F- TFFF–F- FFFFFFFF –––T-
F F–T–T- F–T–T- F–T–T- F–T–– FFFTFFTF cc to FT–-F-F FT–-F-F FT–-F-F -T––-F cc ––-T– to -T-T-FT- -T-T-FT- -T-T-FT- -T-T–– to cc
GlobalRessAlloc (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc06 nc nc nc nc nc nc nc07 nc nc nc nc nc nc nc09 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc11 nc nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FFFTTFFF F-TF-FF- F-TF-FF- ––-FF- to FTFTTFFF ––-TT- cc to to to cc to cc Kanban (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTTTTTT -TT–T-T -TT–T-T -TT–T-T ––-T– FTTTFFFF cc
FTFT?FTF TT––TF TT––TF -T––TF cc cc –––F-
FTTTFFFT –––FT –––FT –––FT –––FT FFFFFFFT cc
FTTTFTTF –T–TT- –T–TT- –T–TT- –T––- FTFTFTTF ––-TT- to ––-F-F ––-F-F ––-F-F cc FFFTFFFF cc mp cc cc cc cc to cc
FTTF T–––- T–––- T–––- cc to cc to -F-T–-T -F-T–-T -F-T–-T -F-T–– to –––-F
LamportFastMutEx (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LamportFastMutEx (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFTFTF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc to cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc to cc cc cc cc cc cc cc
MAPK (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFTFFTTF -FTF–– -FTF–– -FTF–– -FTF–– FFTTTFFF cc
TTFTTFFF -T-T–F- -T-T–F- -T-T–F- -T-T–F- FFFTFFFF cc to –––T- –––T- –––T- –––T- FFFFFFFF cc to -TFF–– -TFF–– -TFF–– to FFTTFFFF cc to –-F–F- –-F–F- –-F–F- to to cc to –––-T –––-T –––-T –––-T to cc
NeoElection (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
NeoElection (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFT–– FTFT–– cc FTFT–– FFFFTFFF cc –-T–F- –-T–F- –-T–F- –––F- cc cc cc cc cc cc to cc –––T- –––T- to to cc cc cc cc cc cc cc cc cc cc cc cc to cc to to to to to to
PermAdmissibility (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
01 nc nc nc nc nc nc nc02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara to TTFF–F- TTFF–F- TTFF–F- TTFF–– FTFFTFFF cc FTFTTTTF -F-F–-F -F-F–-F to to to cc ?????FFT cc cc to to to cc FTFTFFTT FFTF–T- FFTF–T- FFTF–T- FFTF–T- to –––T- FFFT?FTF –-T–– –-T–– to to cc cc FFTFFTFT –––TT –––TT to to to cc
Peterson (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Peterson (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara –F–TT- –F–TT- –F–-T- –T––- FFFFFFTF cc ––-T– ––-T– ––-T– cc FFFTFFFF cc -T––TF -T––TF -T––TF -T––TF cc cc -T––– -T––– to to cc cc –F––T –F––T –F––T –F––T to to –––FF –––FF to –––-F to cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Philosophers (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FFFTTFTF -F––T- -F––T- -F––T- -F––T- FFTTTFTF –––F-
FTFFFTTT –-F-T-T –-F-T-T –-F-T-T –-F-T-T FTFFFFFF cc
TTFF?FTF T–F–– T–F–– T–F–– to cc cc mp cc cc cc cc FTFTFFFF cc mp -T-T–– -T-T–– -T-T–– to cc cc mp cc cc cc cc FFFTFFFF cc to cc cc cc cc FFFFFFFF cc mp cc cc cc cc to cc mp –-F–– –-F–– –-F–– to cc cc mp to to to to to to cc to to to to to to
PhilosophersDyn (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
03 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc50 nc nc nc nc nc nc nc80 nc nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara FTFTTFFF ––-F– ––-F– ––-F– ––-F– FFFFFFFF cc FTTT ––-FFF ––-FFF –––F- cc to cc mp to to to to to cc Planning (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara nf nf nf nf nf nf nf
Railroad (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc –TF–F- –TF–F- –––F- –TF–F- FFFFFFFF cc
010 nc -F–-T-T -F–-T-T -F––– ––-T-T cc cc
020 nc -F––TT -F––TT -F––TT to to –––FF
050 nc ––-T-F ––-T-F ––-T-F to to ––-F-T
100 nc to to to to to cc
RessAllocation (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
R002C002 nc
F–T-TFT F–T-TFT –-T-TFT F–T-TFT FFFFTFFF ––-FT-
R003C002 nc -FTT–F- -FTT–F- -FTT–F- -FTT–F- FFFTFFFF cc
R003C003 nc
F––TTF F––TTF ––-TTF –––T- cc cc
R003C005 nc -F––– -F––– -F––– -F––– cc cc
R003C010 nc
FFFF–F- FFFF–F- -F-F–F- -F-F–F- FFFFTFFF cc
R003C015 nc –FF–-T –FF–-T –FF–-T –FF–– FFFFFFFF –FF––
R003C020 nc –-F–– –-F–– to –-F–– FFFFTFTF cc
R003C050 nc –-F–F- –-F–F- to to FFFTFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
R003C100 nc
TT––-F TT––-F TT––-F TT––-F to –––-T
R005C002 nc
FF-F-T– FF-F-T– -F-F-T– -F-F-T– cc cc
R010C002 nc -FTT-TTT -FTT-TTT -F-T-TTT -FTT-TTT FFFTFFFF cc
R015C002 nc
FTTF-F-T FTTF-F-T FTTF-F-T FTTF-F-T FTTTTFFT cc
R020C002 nc
T-F-F-F- T-F-F-F- T-F-F-F- T-F-F-F- FFFFTFFF cc
R050C002 nc cc cc cc to FFFTTFFF cc
R100C002 nc
FFF––- FFF––- FFF––- to to FFF––-
Ring (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none nc -F––F- -F––F- -F––F- to FFFFFFFF cc
RwMutex (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara r0010w0010 nc
TFTT-T-F TFTT-T-F TFTT–– TFTT–– FFFTFFFF cc r0010w0020 nc
F––TTT F––TTT ––-TTT cc FFFTTFTF cc r0010w0050 nc -T-F-T– -T-F-T– -T-F-T– cc FTFFFFFF cc r0010w0100 nc ––-FTT ––-FTT –––T- cc cc cc r0010w0500 nc
F-TF-F– F-TF-F– cc F-TF-F– FFFFFFFF cc r0010w1000 nc -FTT-T– -FTT-T– -F-T–– -FTT-T– FFFTFFFF cc r0010w2000 nc -FT–T-F -FT–T-F –––-F to to cc r0020w0010 nc -TF–-FT -TF–-FT -TF–-F- -T––F- to cc r0100w0010 nc –-T–– –-T–– –-T–– –-T–– cc cc r0500w0010 nc –––T- –––T- –––T- to cc –––F- r1000w0010 nc
FT-T-FFT FT-T-FFT –-T-FFT –-T–FT cc –––-F r2000w0010 nc –-TFT– –-TFT– –-TF–- cc cc cc
SharedMemory (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
SharedMemory (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTTT?FFT -F-F-TFF -F-F-TFF -F-F–F- -F-F–– cc cc
FFFF?FTF –TF–-T –TF–-T –-F–– cc cc cc mp TFT––- TFT––- TFT––- to FFFFFFFF cc mp cc cc cc cc cc cc mp ––-TFT ––-TFT ––-TFT ––-TFT cc –––FT cc cc cc cc cc to cc
SimpleLoadBal (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc nc05 nc nc nc nc nc nc nc10 nc nc nc nc nc nc nc15 nc nc nc nc nc nc nc20 nc nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc ––-FT- ––-FT- –––T- –––T- FFFFFFTF cc
05 nc –––F- –––F- –––F- –––F- cc cc
10 nc -F–-FF- -F–-FF- -F–-FF- -F––– cc to eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
15 nc to to to to to cc
20 nc to to to to to cc
TokenRing (colored)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
005 nc nc nc nc nc nc nc010 nc nc nc nc nc nc nc020 nc nc nc nc nc nc nc050 nc nc nc nc nc nc nc100 nc nc nc nc nc nc nc200 nc nc nc nc nc nc nc500 nc nc nc nc nc nc nc
TokenRing (P/T)
Instances
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
FTFTFFTF TF–-T-T TF–-T-T -F––– -F––– FTFTFFTF T––T-T to F-T–TT- F-T–TT- –––T- –––T- FTFTFFTF cc mp to to to to cc cc cc cc cc cc cc to cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFTTFTF cc cc cc cc cc FTFTTFFF cc cc cc cc cc FFTTTFTT cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
F––-TF F––-TF F––-TF F––-T- to cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara none
FT–-TT- FT–-TT- FT–-TT- to FFFFFFFF cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are:288 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
47 191 191 158 116 92 52CSRepetitions (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 2 2 2 2 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
10 10 10 3 3 2 2Peterson (Colored)
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 0 0 0max reached 0 0 0 0 0 0 0best 0 0 0 0 0 0 0subtotal
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
GreatSPN LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Total Score
12 12 12 6 17 0HouseConstruction (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Vasy2003 (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Marcie Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models
LoLA LoLa opt LoLa opt inc
191 points 191 points 158 points
For “Surprise” Models
Marcie LoLA LoLa opt LoLa opt inc
17 points 12 points 12 points 12 points
Global
LoLA LoLa opt LoLa opt inc
215 points 215 points 182 points 294 art V
LTL-based Analysis eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
18 The LTLCardinalityComparison Examination
This examination deals with LTL properties dealing with checking cardinality of marking only. Wefirst show a summary on the handling of models by the participating tools. Then, we present the com-puted outputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s CSRepetitions (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Dekker (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
LTLCardinal-ityComparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 297 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Echo (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Eratosthenes (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 298 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s FMS (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Kanban (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
LTLCardinali-tyComparison examination. 299 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s MAPK (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
LTLCardinalityCompar-ison examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s NeoElection (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination. 300 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
LTLCardinalityComparison examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Peterson (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Philosophers (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
LTLCardinalityComparison examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Railroad (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s RessAllocation (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Ring (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s RwMutex (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s SharedMemory (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
LTLCardinality-Comparison examination. 303 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
LTLCardinalityCompar-ison examination.
TokenRing (P/T)
No instance of this model could be computed for the
LTLCardinalityComparison examination.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s HouseConstruction (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
LTLCardinali-tyComparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for LTLCardinalityComparison : memory / / , : s e c ond s Vasy2003 (P/T) for LTLCardinalityComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.305 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc03 nc nc nc nc nc nc04 nc nc nc nc nc nc05 nc nc nc nc nc nc07 nc nc nc nc nc nc10 nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTFTTTTF cc cc cc cc cc FTTTTFTF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Dekker (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FTFTTFTF cc cc cc cc cc FTFTFFTT cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
DotAndBoxes (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
DrinkVendingMachine (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc10 nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Echo (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara d02r09 cc cc cc cc nc cc d02r11 cc cc cc cc nc cc d02r15 cc cc cc cc nc cc d02r19 cc cc cc cc nc cc d03r03 cc cc cc cc nc cc d03r05 cc cc cc cc nc cc d03r07 cc cc cc cc nc cc d04r03 cc cc cc cc nc cc d05r03 cc cc cc cc nc cc Eratosthenes (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFFTFFF cc cc cc cc cc FTFTFFFF cc cc cc cc cc TTTTFFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
FMS (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTFTTTTF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc FFTTTFFF cc cc cc cc cc FTFTTFFF cc cc cc cc cc FFFFFFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
GlobalRessAlloc (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc05 nc nc nc nc nc nc06 nc nc nc nc nc nc07 nc nc nc nc nc nc09 nc nc nc nc nc nc10 nc nc nc nc nc nc11 nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Kanban (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTTTTFTT cc cc cc cc cc TTTTTFTF cc cc cc cc cc FFFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
LamportFastMutEx (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTTFFF cc cc cc cc cc TTTTFFFF cc cc cc cc cc FFFFTFTT cc cc cc cc cc FTFTTFTF cc cc cc cc cc TTTTFFTF cc cc cc cc cc TTTTTFTF cc cc cc cc cc TTTTTTTF cc MAPK (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc FTFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
NeoElection (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to to to to cc to PermAdmissibility (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
01 nc nc nc nc nc nc02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc Peterson (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Peterson (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTTFFF cc cc cc cc cc TTFTFFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Philosophers (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTTTTFFF cc cc cc cc cc FTTTTTTT cc cc cc cc cc FTFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to to to to cc to to to to to cc to
PhilosophersDyn (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc80 nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc Planning (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara nf nf nf nf nf nf
Railroad (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc FFFFFTTF cc cc cc cc cc FTTTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc
RessAllocation (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
R002C002 cc cc cc cc TTFTTTTT cc
R003C002 cc cc cc cc FTFTFTTF cc
R003C003 cc cc cc cc FTTTFFTT cc
R003C005 cc cc cc cc FTTTFTTT cc
R003C010 cc cc cc cc TTFTTTTT cc
R003C015 cc cc cc cc FTFFTTTF cc
R003C020 cc cc cc cc TTTTTFFF cc
R003C050 cc cc cc cc FTTTFFTF cc
R003C100 cc cc cc cc TTTT?FTF cc
R005C002 cc cc cc cc FTTTFTTF cc
R010C002 cc cc cc cc FFFFFFTF cc
R015C002 cc cc cc cc FTFTFFTF cc
R020C002 cc cc cc cc FFFTFFTF cc
R050C002 cc cc cc cc FTFTTFTT cc
R100C002 cc cc cc cc FFFTTFTF cc
Ring (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc nc cc RwMutex (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara r0010w0010 cc cc cc cc FTFTTTTT cc r0010w0020 cc cc cc cc FTTTTFTF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r0010w0050 cc cc cc cc FFFFTFFF cc r0010w0100 cc cc cc cc FFFTTTTT cc r0010w0500 cc cc cc cc cc cc r0010w1000 cc cc cc cc cc cc r0010w2000 cc cc cc cc cc cc r0020w0010 cc cc cc cc FFFFFFFF cc r0100w0010 cc cc cc cc FTFTFFTF cc r0500w0010 cc cc cc cc cc cc r1000w0010 cc cc cc cc cc cc r2000w0010 cc cc cc cc cc cc
SharedMemory (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
SharedMemory (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFTF cc cc cc cc cc TTFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc15 nc nc nc nc nc nc20 nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTTTFFFF cc cc cc cc cc FTFTTFTF cc cc cc cc cc FTFT?FTF cc cc cc cc cc TTFTTTTF cc cc cc cc cc cc cc TokenRing (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
TokenRing (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 4 0max reached 0 0 0 0 0 0best 0 0 0 0 2 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (Colored)
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ).316 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. For “Known” Models Neco
114 points
For “Surprise” Models
No tool could complete this examination.
Global Neco
114 points 317 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
19 The LTLFireability Examination
This examination deals with LTL properties dealing with transition fireability only. We first show asummary on the handling of models by the participating tools. Then, we present the computed outputsand the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
LTLFireability exam-ination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for LTLFireability : memory / / , : s e c ond s CSRepetitions (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for LTLFireability : memory / / , : s e c ond s Dekker (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
LTLFireability exami-nation.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
LTLFireabil-ity examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 318 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for LTLFireability : memory / / , : s e c ond s DrinkVendingMachine (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for LTLFireability : memory / / , : s e c ond s Echo (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for LTLFireability : memory / / , : s e c ond s Eratosthenes (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 319 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for LTLFireability : memory / / , : s e c ond s FMS (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
LTLFireability ex-amination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for LTLFireability : memory / / , : s e c ond s GlobalRessAlloc (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for LTLFireability : memory / / , : s e c ond s Kanban (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
LTLFireability examination. 320 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for LTLFireability : memory / / , : s e c ond s LamportFastMutEx (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for LTLFireability : memory / / , : s e c ond s MAPK (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
LTLFireability exami-nation.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for LTLFireability : memory / / , : s e c ond s NeoElection (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
LTLFireability examination. 321 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for LTLFireability : memory / / , : s e c ond s PermAdmissibility (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
LTLFireability examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for LTLFireability : memory / / , : s e c ond s Peterson (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
LTLFireability exami-nation.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for LTLFireability : memory / / , : s e c ond s Philosophers (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
LTLFireability ex-amination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for LTLFireability : memory / / , : s e c ond s PhilosophersDyn (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
LTLFireability examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for LTLFireability : memory / / , : s e c ond s Railroad (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for LTLFireability : memory / / , : s e c ond s RessAllocation (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for LTLFireability : memory / / , : s e c ond s Ring (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for LTLFireability : memory / / , : s e c ond s RwMutex (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
LTLFireability ex-amination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for LTLFireability : memory / / , : s e c ond s SharedMemory (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
LTLFireability exam-ination. 324 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for LTLFireability : memory / / , : s e c ond s SimpleLoadBal (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
LTLFireability examina-tion.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for LTLFireability : memory / / , : s e c ond s TokenRing (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for LTLFireability : memory / / , : s e c ond s HouseConstruction (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for LTLFireability : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
LTLFireability examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for LTLFireability : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for LTLFireability : memory / / , : s e c ond s Vasy2003 (P/T) for LTLFireability : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc03 nc nc nc nc nc nc04 nc nc nc nc nc nc05 nc nc nc nc nc nc07 nc nc nc nc nc nc10 nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Dekker (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc
200 nc cc cc cc cc cc
DotAndBoxes (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
DrinkVendingMachine (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc10 nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Echo (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. d02r09 cc cc cc cc nc cc d02r11 cc cc cc cc nc cc d02r15 cc cc cc cc nc cc d02r19 cc cc cc cc nc cc d03r03 cc cc cc cc nc cc d03r05 cc cc cc cc nc cc d03r07 cc cc cc cc nc cc d04r03 cc cc cc cc nc cc d05r03 cc cc cc cc nc cc Eratosthenes (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTFTTTTT cc cc cc cc cc TTTTFTTT cc cc cc cc cc TTFFTTTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
FMS (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTTTFFFF cc cc cc cc cc FTFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFTT cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
GlobalRessAlloc (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc05 nc nc nc nc nc nc06 nc nc nc nc nc nc07 nc nc nc nc nc nc09 nc nc nc nc nc nc10 nc nc nc nc nc nc11 nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Kanban (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFTF cc cc cc cc cc FFFTTFFF cc cc cc cc cc FTFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
LamportFastMutEx (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (P/T) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc to cc MAPK (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
NeoElection (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
NeoElection (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc PermAdmissibility (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
01 nc nc nc nc nc nc02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc Peterson (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Peterson (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc FFFTTFFF cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Philosophers (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Philosophers (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFTT cc cc cc cc cc FTFFFFTF cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
PhilosophersDyn (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc80 nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc Planning (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara nf nf nf nf nf nf
Railroad (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFTT cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFTTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc
RessAllocation (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
R002C002 cc cc cc cc FTFTFFFF cc
R003C002 cc cc cc cc FFFTTTTT cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
R003C003 cc cc cc cc FTFTFFFF cc
R003C005 cc cc cc cc FFFFFFFF cc
R003C010 cc cc cc cc FFTTFFTF cc
R003C015 cc cc cc cc FFFFTFFF cc
R003C020 cc cc cc cc FFFFFFFF cc
R003C050 cc cc cc cc FTFFTFFF cc
R003C100 cc cc cc cc FFFFFFTF cc
R005C002 cc cc cc cc FFTTFFTF cc
R010C002 cc cc cc cc FFFTFFFF cc
R015C002 cc cc cc cc FFFFTFFF cc
R020C002 cc cc cc cc FFFFTFFF cc
R050C002 cc cc cc cc FFFFFFFF cc
R100C002 cc cc cc cc FFFFTFFF cc
Ring (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc nc cc RwMutex (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara r0010w0010 cc cc cc cc FFFFFFTF cc r0010w0020 cc cc cc cc FTTTFFFT cc r0010w0050 cc cc cc cc FTFFTFFF cc r0010w0100 cc cc cc cc FTFTFTTT cc r0010w0500 cc cc cc cc cc cc r0010w1000 cc cc cc cc cc cc r0010w2000 cc cc cc cc cc cc r0020w0010 cc cc cc cc FFFTFFTF cc r0100w0010 cc cc cc cc FTTTTFTF cc r0500w0010 cc cc cc cc cc cc r1000w0010 cc cc cc cc cc cc r2000w0010 cc cc cc cc cc cc
SharedMemory (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
SharedMemory (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc15 nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
20 nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTTTTFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc to cc cc cc cc cc to cc cc cc cc cc cc cc TokenRing (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nc nc nc nc nc nc010 nc nc nc nc nc nc020 nc nc nc nc nc nc050 nc nc nc nc nc nc100 nc nc nc nc nc nc200 nc nc nc nc nc nc500 nc nc nc nc nc nc
TokenRing (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 2 0max reached 0 0 0 0 0 0best 0 0 0 0 2 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (Colored)
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models Neco
88 points
For “Surprise” Models
No tool could complete this examination.
Global Neco
88 points 338 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
20 The LTLMarkingComparison Examination
This examination deals with LTL properties dealing with marking comparison only. We first show asummary on the handling of models by the participating tools. Then, we present the computed outputsand the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
LTLMarkingCompar-ison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for LTLMarkingComparison : memory / / , : s e c ond s CSRepetitions (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
No instance of this model could be computed for the
LTLMarkingComparison exam-ination.
DotAndBoxes (colored)
No instance of this model could be computed for the
LTLMarkingCompar-ison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
LTLMarking-Comparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s DrinkVendingMachine (P/T) for LTLMarkingComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
No instance of this model could be computed for the
LTLMarkingComparison exami-nation. 339 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Eratosthenes (P/T)
No instance of this model could be computed for the
LTLMarkingComparison examination.
FMS (P/T)
No instance of this model could be computed for the
LTLMarkingComparison exami-nation.
GlobalRessAlloc (colored)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for LTLMarkingComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
No instance of this model could be computed for the
LTLMarkingComparison exam-ination.
LamportFastMutEx (colored)
No instance of this model could be computed for the
LTLMarking-Comparison examination.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for LTLMarkingComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
No instance of this model could be computed for the
LTLMarkingComparison exam-ination.
NeoElection (colored)
No instance of this model could be computed for the
LTLMarkingCompari-son examination. 340 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for LTLMarkingComparison : memory / / , : s e c ond s NeoElection (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for LTLMarkingComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
LTLMarkingComparison examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for LTLMarkingComparison : memory / / , : s e c ond s Peterson (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (colored)
No instance of this model could be computed for the
LTLMarkingCompari-son examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for LTLMarkingComparison : memory / / , : s e c ond s Philosophers (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for LTLMarkingComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
LTLMarkingComparison ex-amination.
Railroad (P/T)
No instance of this model could be computed for the
LTLMarkingComparison ex-amination.
RessAllocation (P/T)
No instance of this model could be computed for the
LTLMarkingCompari-son examination.
Ring (P/T)
No instance of this model could be computed for the
LTLMarkingComparison examina-tion.
RwMutex (P/T)
No instance of this model could be computed for the
LTLMarkingComparison ex-amination.
SharedMemory (colored)
No instance of this model could be computed for the
LTLMarkingCom-parison examination. 342 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for LTLMarkingComparison : memory / / , : s e c ond s SharedMemory (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for LTLMarkingComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
LTLMarkingComparison examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for LTLMarkingComparison : memory / / , : s e c ond s TokenRing (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
HouseConstruction (P/T)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
IBMB2S565S3960 (P/T)
No instance of this model could be computed for the
LTLMarkingCom-parison examination.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
LTLMarking-Comparison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for LTLMarkingComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for LTLMarkingComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
No instance of this model could be computed for the
LTLMarkingComparison ex-amination.
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc03 nc nc nc nc nc nc04 nc nc nc nc nc nc05 nc nc nc nc nc nc07 nc nc nc nc nc nc10 nc nc nc nc nc nc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTTFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Dekker (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
010 nf nf nf nf nf nf015 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf
DotAndBoxes (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
DrinkVendingMachine (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc10 nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Echo (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara d02r09 nf nf nf nf nf nfd02r11 nf nf nf nf nf nfd02r15 nf nf nf nf nf nfd02r19 nf nf nf nf nf nfd03r03 nf nf nf nf nf nfd03r05 nf nf nf nf nf nfd03r07 nf nf nf nf nf nfd04r03 nf nf nf nf nf nfd05r03 nf nf nf nf nf nf
Eratosthenes (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
FMS (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
002 nf nf nf nf nf nf005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
GlobalRessAlloc (colored) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc05 nc nc nc nc nc nc06 nc nc nc nc nc nc07 nc nc nc nc nc nc09 nc nc nc nc nc nc10 nc nc nc nc nc nc11 nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Kanban (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFT cc cc cc cc cc FFFFFFFF cc MAPK (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
008 nf nf nf nf nf nf020 nf nf nf nf nf nf040 nf nf nf nf nf nf080 nf nf nf nf nf nf160 nf nf nf nf nf nf320 nf nf nf nf nf nf
NeoElection (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
NeoElection (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc PermAdmissibility (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
01 nc nc nc nc nc nc02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc Peterson (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Peterson (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Philosophers (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Philosophers (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFTTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
PhilosophersDyn (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc80 nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc Planning (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara nf nf nf nf nf nf
Railroad (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf
RessAllocation (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
R002C002 nf nf nf nf nf nfR003C002 nf nf nf nf nf nfR003C003 nf nf nf nf nf nfR003C005 nf nf nf nf nf nfR003C010 nf nf nf nf nf nfR003C015 nf nf nf nf nf nfR003C020 nf nf nf nf nf nfR003C050 nf nf nf nf nf nfR003C100 nf nf nf nf nf nfR005C002 nf nf nf nf nf nfR010C002 nf nf nf nf nf nfR015C002 nf nf nf nf nf nfR020C002 nf nf nf nf nf nfR050C002 nf nf nf nf nf nfR100C002 nf nf nf nf nf nf
Ring (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none nf nf nf nf nf nf
RwMutex (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara r0010w0010 nf nf nf nf nf nfr0010w0020 nf nf nf nf nf nfr0010w0050 nf nf nf nf nf nfr0010w0100 nf nf nf nf nf nfr0010w0500 nf nf nf nf nf nfr0010w1000 nf nf nf nf nf nfr0010w2000 nf nf nf nf nf nfr0020w0010 nf nf nf nf nf nfr0100w0010 nf nf nf nf nf nfr0500w0010 nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r1000w0010 nf nf nf nf nf nfr2000w0010 nf nf nf nf nf nf
SharedMemory (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
SharedMemory (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc15 nc nc nc nc nc nc20 nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc TokenRing (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nc nc nc nc nc nc010 nc nc nc nc nc nc020 nc nc nc nc nc nc050 nc nc nc nc nc nc100 nc nc nc nc nc nc200 nc nc nc nc nc nc500 nc nc nc nc nc nc
TokenRing (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
002 nf nf nf nf nf nf005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none nf nf nf nf nf nf
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none nf nf nf nf nf nf
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Neco
54 points
For “Surprise” Models
No tool could complete this examination.
Global Neco
54 points 356 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
21 The LTLPlaceComparison Examination
This examination deals with LTL properties dealing with the comparison of places marking only. Wefirst show a summary on the handling of models by the participating tools. Then, we present the com-puted outputs and the associated scores for this examination prior to a summary of relevant executions.
CSRepetitions (colored)
No instance of this model could be computed for the
LTLPlaceComparison examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for LTLPlaceComparison : memory / / , : s e c ond s CSRepetitions (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Dekker (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
LTLPlaceComparison examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
LTLPlace-Comparison examination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 357 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for LTLPlaceComparison : memory / / , : s e c ond s DrinkVendingMachine (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Echo (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Eratosthenes (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 358 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for LTLPlaceComparison : memory / / , : s e c ond s FMS (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
LTLPlaceCompari-son examination.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for LTLPlaceComparison : memory / / , : s e c ond s GlobalRessAlloc (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Kanban (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
LTLPlaceCom-parison examination. 359 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for LTLPlaceComparison : memory / / , : s e c ond s LamportFastMutEx (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for LTLPlaceComparison : memory / / , : s e c ond s MAPK (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
LTLPlaceComparison examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for LTLPlaceComparison : memory / / , : s e c ond s NeoElection (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
LTLPlaceCom-parison examination. 360 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for LTLPlaceComparison : memory / / , : s e c ond s PermAdmissibility (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
LTLPlaceComparison ex-amination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Peterson (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
LTLPlaceComparison examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Philosophers (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (colored)
No instance of this model could be computed for the
LTLPlaceCompar-ison examination.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for LTLPlaceComparison : memory / / , : s e c ond s PhilosophersDyn (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
LTLPlaceComparison exami-nation.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Railroad (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for LTLPlaceComparison : memory / / , : s e c ond s RessAllocation (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Ring (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Ring (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for LTLPlaceComparison : memory / / , : s e c ond s RwMutex (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
LTLPlaceCompari-son examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for LTLPlaceComparison : memory / / , : s e c ond s SharedMemory (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
LTLPlaceCompari-son examination. 363 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SimpleLoadBal (P/T) for LTLPlaceComparison : memory / / , : s e c ond s SimpleLoadBal (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
LTLPlaceComparison examination.
TokenRing (P/T)
No instance of this model could be computed for the
LTLPlaceComparison exam-ination.
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for LTLPlaceComparison : memory / / , : s e c ond s HouseConstruction (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). M B y t e s IBMB2S565S3960 (P/T) for LTLPlaceComparison : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
LTLPlaceCom-parison examination.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for LTLPlaceComparison : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for LTLPlaceComparison : memory / / , : s e c ond s Vasy2003 (P/T) for LTLPlaceComparison : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.365 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
CSRepetitions (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc03 nc nc nc nc nc nc04 nc nc nc nc nc nc05 nc nc nc nc nc nc07 nc nc nc nc nc nc10 nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTTFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc FFFFFFFT cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Dekker (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTFTTFTF cc cc cc cc cc FTFTFFFT cc cc cc cc cc FTFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
DotAndBoxes (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
DrinkVendingMachine (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc10 nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Echo (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara d02r09 cc cc cc cc nc cc d02r11 cc cc cc cc nc cc d02r15 cc cc cc cc nc cc d02r19 cc cc cc cc nc cc d03r03 cc cc cc cc nc cc d03r05 cc cc cc cc nc cc d03r07 cc cc cc cc nc cc d04r03 cc cc cc cc nc cc d05r03 cc cc cc cc nc cc Eratosthenes (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFTF cc cc cc cc cc TTFTTFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
FMS (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFTTT cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc FTTTFFFF cc cc cc cc cc FTFFTFFF cc cc cc cc cc TTTTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
GlobalRessAlloc (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc05 nc nc nc nc nc nc06 nc nc nc nc nc nc07 nc nc nc nc nc nc09 nc nc nc nc nc nc10 nc nc nc nc nc nc11 nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Kanban (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFTF cc cc cc cc cc FFFFTFTF cc cc cc cc cc FTFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
LamportFastMutEx (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFTTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFFFFFFF cc MAPK (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTTFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
NeoElection (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
NeoElection (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc PermAdmissibility (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
01 nc nc nc nc nc nc02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc Peterson (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Peterson (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Philosophers (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Philosophers (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
PhilosophersDyn (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc80 nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc Planning (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara nf nf nf nf nf nf
Railroad (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFTT cc cc cc cc cc FTTTFFFF cc cc cc cc cc TTFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc
RessAllocation (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
R002C002 cc cc cc cc FTTTTFFF cc
R003C002 cc cc cc cc FTTTTFTF cc
R003C003 cc cc cc cc TTFTTFFF cc
R003C005 cc cc cc cc FFFFTFFF cc
R003C010 cc cc cc cc FTFTFFFF cc
R003C015 cc cc cc cc FTFTTFFF cc
R003C020 cc cc cc cc TTFTFFFF cc
R003C050 cc cc cc cc FTFFTFTF cc
R003C100 cc cc cc cc TTFTTFFF cc
R005C002 cc cc cc cc FTFTTFTF cc
R010C002 cc cc cc cc FTFTTFTT cc
R015C002 cc cc cc cc TTTTFFTT cc
R020C002 cc cc cc cc FTFTTFFF cc
R050C002 cc cc cc cc FTFTFFFF cc
R100C002 cc cc cc cc FFFTFFTF cc
Ring (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc nc cc RwMutex (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara r0010w0010 cc cc cc cc FTFFTFTF cc r0010w0020 cc cc cc cc FTTTFFTF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. r0010w0050 cc cc cc cc TTFTTTTT cc r0010w0100 cc cc cc cc TTTTTFFF cc r0010w0500 cc cc cc cc cc cc r0010w1000 cc cc cc cc cc cc r0010w2000 cc cc cc cc cc cc r0020w0010 cc cc cc cc FTFTFFFF cc r0100w0010 cc cc cc cc TTTTTFTF cc r0500w0010 cc cc cc cc cc cc r1000w0010 cc cc cc cc cc cc r2000w0010 cc cc cc cc cc cc
SharedMemory (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
SharedMemory (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc15 nc nc nc nc nc nc20 nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc TokenRing (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nf nf nf nf nf nf010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf100 nf nf nf nf nf nf200 nf nf nf nf nf nf500 nf nf nf nf nf nf
TokenRing (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nf nf nf nf nf nf eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
010 nf nf nf nf nf nf020 nf nf nf nf nf nf050 nf nf nf nf nf nf “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are: – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 4 0max reached 0 0 0 0 0 0best 0 0 0 0 2 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (Colored)
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. max reached 0 0 0 0 0 0best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ).376 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. For “Known” Models Neco
114 points
For “Surprise” Models
No tool could complete this examination.
Global Neco
114 points 377 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
22 The LTLMix Examination
This examination deals with LTL properties dealing with all the previous type of atomic proposi-tion. We first show a summary on the handling of models by the participating tools. Then, we presentthe computed outputs and the associated scores for this examination prior to a summary of relevantexecutions.
CSRepetitions (colored)
No instance of this model could be computed for the
LTLMix examination.
CSRepetitions (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s CSRepetitions (P/T) for LTLMix : memory / / , : s e c ond s CSRepetitions (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Dekker (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Dekker (P/T) for LTLMix : memory / / , : s e c ond s Dekker (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
DotAndBoxes (colored)
No instance of this model could be computed for the
LTLMix examination.
DrinkVendingMachine (colored)
No instance of this model could be computed for the
LTLMix ex-amination.
DrinkVendingMachine (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). 378 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s DrinkVendingMachine (P/T) for LTLMix : memory / / , : s e c ond s DrinkVendingMachine (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Echo (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). M B y t e s Echo (P/T) for LTLMix : memory / / , : s e c ond s Echo (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Eratosthenes (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Eratosthenes (P/T) for LTLMix : memory / / , : s e c ond s Eratosthenes (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
FMS (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 379 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s FMS (P/T) for LTLMix : memory / / , : s e c ond s FMS (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
GlobalRessAlloc (colored)
No instance of this model could be computed for the
LTLMix examina-tion.
GlobalRessAlloc (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s GlobalRessAlloc (P/T) for LTLMix : memory / / , : s e c ond s GlobalRessAlloc (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Kanban (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Kanban (P/T) for LTLMix : memory / / , : s e c ond s Kanban (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
LamportFastMutEx (colored)
No instance of this model could be computed for the
LTLMix exami-nation. 380 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LamportFastMutEx (P/T)
The charts below respectively show how tools compete with this“Known” model (memory and CPU). M B y t e s LamportFastMutEx (P/T) for LTLMix : memory / / , : s e c ond s LamportFastMutEx (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
MAPK (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s MAPK (P/T) for LTLMix : memory / / , : s e c ond s MAPK (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
NeoElection (colored)
No instance of this model could be computed for the
LTLMix examination.
NeoElection (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s NeoElection (P/T) for LTLMix : memory / / , : s e c ond s NeoElection (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PermAdmissibility (colored)
No instance of this model could be computed for the
LTLMix examina-tion. 381 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PermAdmissibility (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PermAdmissibility (P/T) for LTLMix : memory / / , : s e c ond s PermAdmissibility (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Peterson (colored)
No instance of this model could be computed for the
LTLMix examination.
Peterson (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Peterson (P/T) for LTLMix : memory / / , : s e c ond s Peterson (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Philosophers (colored)
No instance of this model could be computed for the
LTLMix examination.
Philosophers (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Philosophers (P/T) for LTLMix : memory / / , : s e c ond s Philosophers (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
PhilosophersDyn (colored)
No instance of this model could be computed for the
LTLMix examina-tion. 382 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
PhilosophersDyn (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s PhilosophersDyn (P/T) for LTLMix : memory / / , : s e c ond s PhilosophersDyn (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Planning (P/T)
No instance of this model could be computed for the
LTLMix examination.
Railroad (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s Railroad (P/T) for LTLMix : memory / / , : s e c ond s Railroad (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RessAllocation (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s RessAllocation (P/T) for LTLMix : memory / / , : s e c ond s RessAllocation (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Ring (P/T)
The charts below respectively show how tools compete with this “Known” model (mem-ory and CPU). 383 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s Ring (P/T) for LTLMix : memory / / , : s e c ond s Ring (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
RwMutex (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s RwMutex (P/T) for LTLMix : memory / / , : s e c ond s RwMutex (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SharedMemory (colored)
No instance of this model could be computed for the
LTLMix examination.
SharedMemory (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). M B y t e s SharedMemory (P/T) for LTLMix : memory / / , : s e c ond s SharedMemory (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
SimpleLoadBal (colored)
No instance of this model could be computed for the
LTLMix examination.
SimpleLoadBal (P/T)
The charts below respectively show how tools compete with this “Known”model (memory and CPU). 384 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s SimpleLoadBal (P/T) for LTLMix : memory / / , : s e c ond s SimpleLoadBal (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
TokenRing (colored)
No instance of this model could be computed for the
LTLMix examination.
TokenRing (P/T)
The charts below respectively show how tools compete with this “Known” model(memory and CPU). M B y t e s TokenRing (P/T) for LTLMix : memory / / , : s e c ond s TokenRing (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
HouseConstruction (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s HouseConstruction (P/T) for LTLMix : memory / / , : s e c ond s HouseConstruction (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
IBMB2S565S3960 (P/T)
The charts below respectively show how tools compete with this “Suprise”model (memory and CPU). 385 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. M B y t e s IBMB2S565S3960 (P/T) for LTLMix : memory / / , : s e c ond s IBMB2S565S3960 (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
QuasiCertifProtocol (colored)
No instance of this model could be computed for the
LTLMix exami-nation.
QuasiCertifProtocol (P/T)
The charts below respectively show how tools compete with this“Suprise” model (memory and CPU). M B y t e s QuasiCertifProtocol (P/T) for LTLMix : memory / / , : s e c ond s QuasiCertifProtocol (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Vasy2003 (P/T)
The charts below respectively show how tools compete with this “Suprise” model(memory and CPU). M B y t e s Vasy2003 (P/T) for LTLMix : memory / / , : s e c ond s Vasy2003 (P/T) for LTLMix : cpu / / , : AlPiNACunfGreatSPN ITS-ToolsLoLALoLA (opt.) LoLA (Opt. incompl.)LoLA (pess.)MARCIE NecoPNXDDSara
Please find enclosed the brute results for this examination (“Known” and “Surprise” models). Wedisplay only the score of tools that provide a results for at least one instance of one model. The legendfor the values is provided below: 386 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – nc : the tool does not compete this examination for this model/instance, – cc : the tool cannot compute this examination for this model/instance, – to : the tool cannot compute this examination for this model/instance within the maximum allowedtime, – mp : the tool encountered a memory problem (stack overflow or memory full), – nf : there is no formula available for this type of examination (typically, this concerns P/T nets wherecomparing marking cardinality has no signification when there is no equivalent colored net).
Note on the display of results for formulas: each formula is considered as a flag (F if false, T if true, -or ? when the value cannot be determined). These values are concatenated in the order they appear (weassume it is the order of formulas as they were provided). “Known” Models
Results are summarized in the table below.
CSRepetitions (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc03 nc nc nc nc nc nc04 nc nc nc nc nc nc05 nc nc nc nc nc nc07 nc nc nc nc nc nc10 nc nc nc nc nc nc
CSRepetitions (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFTTTTT cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Dekker (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFTF cc cc cc cc cc FTFTTTTT cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc nc cc cc cc cc DotAndBoxes (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
DrinkVendingMachine (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc10 nc nc nc nc nc nc
DrinkVendingMachine (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Echo (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara d02r09 cc cc cc cc nc cc d02r11 cc cc cc cc nc cc d02r15 cc cc cc cc nc cc d02r19 cc cc cc cc nc cc d03r03 cc cc cc cc nc cc d03r05 cc cc cc cc nc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. d03r07 cc cc cc cc nc cc d04r03 cc cc cc cc nc cc d05r03 cc cc cc cc nc cc Eratosthenes (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFTF cc cc cc cc cc FTTTFFTF cc cc cc cc cc TTFTTFTF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
FMS (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc FTFTTFFF cc cc cc cc cc FFFTTFTF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
GlobalRessAlloc (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc05 nc nc nc nc nc nc06 nc nc nc nc nc nc07 nc nc nc nc nc nc09 nc nc nc nc nc nc10 nc nc nc nc nc nc11 nc nc nc nc nc nc
GlobalRessAlloc (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc Kanban (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTTTFTTT cc cc cc cc cc FFFTTFFF cc cc cc cc cc FFFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
LamportFastMutEx (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LamportFastMutEx (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc FFFFTFFF cc cc cc cc cc to cc cc cc cc cc FFFFTTTF cc cc cc cc cc FTFTFFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc to cc cc cc cc cc to cc MAPK (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FTFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
NeoElection (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
NeoElection (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to to to to cc to PermAdmissibility (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
01 nc nc nc nc nc nc02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc
PermAdmissibility (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc cc cc cc cc nc cc Peterson (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Peterson (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTTFFF cc cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. Philosophers (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Philosophers (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc TTFTFFFF cc cc cc cc cc FTFFTFFF cc cc cc cc cc FFFFFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc to to to to cc to cc cc cc cc cc cc
PhilosophersDyn (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
03 nc nc nc nc nc nc10 nc nc nc nc nc nc20 nc nc nc nc nc nc50 nc nc nc nc nc nc80 nc nc nc nc nc nc
PhilosophersDyn (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FTFTFFFF cc cc cc cc cc cc cc cc cc cc cc cc cc Planning (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara nf nf nf nf nf nf
Railroad (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTTFFF cc cc cc cc cc FTFTFFFF cc cc cc cc cc FTFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc
RessAllocation (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
R002C002 cc cc cc cc FTTTFFFF cc
R003C002 cc cc cc cc FFFTFFTF cc
R003C003 cc cc cc cc TTFTTTTF cc
R003C005 cc cc cc cc FFFFFFFF cc
R003C010 cc cc cc cc FFFFFTTF cc
R003C015 cc cc cc cc FTTTFFTF cc
R003C020 cc cc cc cc FFFFFFTF cc
R003C050 cc cc cc cc FTFFTFFF cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
R003C100 cc cc cc cc FFFFTFFF cc
R005C002 cc cc cc cc FTFTTFFF cc
R010C002 cc cc cc cc TTFTFFTF cc
R015C002 cc cc cc cc FTFTTFFF cc
R020C002 cc cc cc cc FTTTFFFF cc
R050C002 cc cc cc cc FTFFTFFF cc
R100C002 cc cc cc cc FTFTTFFF cc
Ring (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc nc cc RwMutex (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara r0010w0010 cc cc cc cc FTFTTFTF cc r0010w0020 cc cc cc cc FFFFTTTT cc r0010w0050 cc cc cc cc FTFTFTTT cc r0010w0100 cc cc cc cc FFFTFFTF cc r0010w0500 cc cc cc cc cc cc r0010w1000 cc cc cc cc cc cc r0010w2000 cc cc cc cc cc cc r0020w0010 cc cc cc cc TTTTTFFF cc r0100w0010 cc cc cc cc FTTTFTTF cc r0500w0010 cc cc cc cc cc cc r1000w0010 cc cc cc cc cc cc r2000w0010 cc cc cc cc cc cc
SharedMemory (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
SharedMemory (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFTFFFF cc cc cc cc cc FFFTTFFF cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
SimpleLoadBal (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc05 nc nc nc nc nc nc10 nc nc nc nc nc nc15 nc nc nc nc nc nc20 nc nc nc nc nc nc
SimpleLoadBal (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc FFFFFFFF cc cc cc cc cc FTFTTFTF cc cc cc cc cc to cc eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. cc cc cc cc FFFFTFFF cc cc cc cc cc cc cc TokenRing (colored)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
005 nc nc nc nc nc nc010 nc nc nc nc nc nc020 nc nc nc nc nc nc050 nc nc nc nc nc nc100 nc nc nc nc nc nc200 nc nc nc nc nc nc500 nc nc nc nc nc nc
TokenRing (P/T)
Instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc to cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc “Surprise” Models
Results are summarized in the table below.
HouseConstruction (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc
IBMB2S565S3960 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
QuasiCertifProtocol (colored) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
02 nc nc nc nc nc nc06 nc nc nc nc nc nc10 nc nc nc nc nc nc18 nc nc nc nc nc nc22 nc nc nc nc nc nc28 nc nc nc nc nc nc32 nc nc nc nc nc nc
QuasiCertifProtocol (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc cc Vasy2003 (P/T) instances
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara none cc cc cc cc cc cc
Please find enclosed the scores for this examination (“Known” and “Surprise” models). We displayonly the score of tools that provide a results for at least one instance of one model. The total is first listedin the table below followed by a detail, for each proposed model. Meaning of the line labels are:392 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. – 1st instance : the tool gets a bonus for having processed the first instance of this model (+1 point), – instances : the tool gets 1 point per instances treated (for that, we assume that at least one formulahas been successfully computed), – max reached : the tool could process all the instances for the model (+2 points), – best : the tool is among the ones that processed a maximum of instances within the time and mem-ory confinement (+2 points). “Known” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 411 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. instances 0 0 0 0 0 0max reached 0 0 0 0 0 0best 0 0 0 0 0 0subtotal
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara “Surprise” Models
Scores are summarized in the table below. For each model in this category, a toolmay collect up to 49 points.
Total score of the tools for this examination
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Total Score
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
Vasy2003 (P/T)
LoLA LoLa opt LoLa opt inc LoLa pess Neco Sara
Trophies are divided in three categories: “Known” models, “Surprise” models, and the global trophies(formula is then scor e global = scor e known + × scor e sur pr ise ). For “Known” Models Neco
110 points
For “Surprise” Models
No tool could complete this examination.
Global Neco
110 points 398 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
References
1. Baarir, S., Beccuti, M., Cerotti, D., Pierro, M.D., Donatelli, S., Franceschinis, G.: The greatspn tool: recent en-hancements. SIGMETRICS Performance Evaluation Review 36(4), 4–9 (2009)2. Babar, J., Beccuti, M., Donatelli, S., Miner, A.S.: GreatSPN Enhanced with Decision Diagram Data Structures. In:Applications and Theory of Petri Nets, 31st International Conference. Lecture Notes in Computer Science, vol.6128, pp. 308–317. Springer (2010)3. Baldan, P., Bruni, A., Corradini, A., König, B., Rodríguez, C., Schwoon, S.: Efficient unfolding of contextual Petrinets. Theor. Comput. Sci. 449, 2–22 (2012)4. Baldan, P., Corradini, A., König, B., Schwoon, S.: McMillan’s Complete Prefix for Contextual Nets. T. Petri Netsand Other Models of Concurrency I, 199–220 (2008)5. Bashirov, R., Kordon, F., Lort, H.: Exploiting colored Petri nets to decide on permutation admissibility. ActaInformatica 46(1), 43–55 (February 2009)6. Bonnaire, X., Cortés, R., Kordon, F., Marin, O.: A Scalable Architecture for Highly Reliable Certification. In: 12thIEEE International Conference on Trust, Security and Privacy in Computing and Communications – TrustCom.p. to be published. IEEE Computer Society, Melbourne, Australia (April 2013)7. Buchs, D., Hostettler, S., Marechal, A., Risoldi, M.: AlPiNA: A symbolic model checker. In: 31st InternationalConference on Applications and Theory of Petri Nets, LNCS, vol. 6128, pp. 287–296. Springer (2010)8. Buchs, D., Hostettler, S., Marechal, A., Risoldi, M.: AlPiNA: An Algebraic Petri Net Analyzer. In: Tools and Algo-rithms for the Construction and Analysis of Systems, LNCS, vol. 6015, pp. 349–352. Springer (2010)9. Chen, A., Buchs, D., Lucio, L., Pedro, L., Risoldi, M.: Modeling distributed systems using concurrent object ori-ented petri nets. In: 4th International Workshop on Modelling of Objects, Components and Agents (MOCA). pp.103–122 (2006)10. Chiola, G., Franceschinis, G.: Colored GSPN Models and Automatic Symmetry Detection. In: Petri Nets and Per-formance Models, The Proceedings of the Third International Workshop, PNPM ’89. pp. 50–60. IEEE ComputerSociety (1989)11. Choppy, C., Dedova, A., Evangelista, S., Hong, S., Klai, K., Petrucci, L.: The NEO Protocol for Large-Scale Dis-tributed Database Systems: Modelling and Initial Verification. In: 31st International Conference on Petri Netsand Other Models of Concurrency (ICATPN 2010). LNCS, vol. 6128, pp. 145–164. springer (2010), moVe INT LIP612. Ciardo, G.: Advances in compositional approaches based on kronecker algebra: Application to the study ofmanufacturing systems. In: 3rd International Workshop on Performability Modeling of Computer and Com-munication Systems. pp. 61–65 (1996)13. Ciardo, G., Trivedi, K.: A decomposition approach for stochastic reward net models. Perf. Eval 18, 37–59 (1993)14. Ciardo, G., Lüttgen, G., Siminiceanu, R.: Efficient Symbolic State-Space Construction for Asynchronous Sys-tems. In: Application and Theory of Petri Nets 2000, LNCS, vol. 1825, pp. 103–122. Springer Berlin / Heidelberg(2000)15. Colange, M., Baarir, S., Kordon, F., Thierry-Mieg, Y.: Towards Distributed Software Model-Checking using De-cision Diagrams. In: 25th International Conference on Computer Aided Verification (CAV). Lecture Notes inComputer Science, vol. 8044, pp. 830–845. Springer, Rome, Italy (March 2013)16. Couvreur, J.M., Thierry-Mieg, Y.: Hierarchical Decision Diagrams to Exploit Model Structure. In: 25th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE’05). LNCS,vol. 3731, pp. 443–457. Springer (2005)17. Dasgupta, S., Yakovlev, A.: Modeling and verification of globally asynchronous and locally synchronous ringarchitectures. In: Design, Automation and Test in Europe Conference and Exposition (DATE). pp. 568–569. IEEEComputer Society (2005)18. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)19. Duret-Lutz, A.: Manipulating LTL formulas using Spot 1.0. In: 11th International Symposium on AutomatedTechnology for Verification and Analysis (ATVA). Lecture Notes in Computer Science, vol. to appear, p. to appear.Springer (Jul 2013)20. Duret-Lutz, A., Poitrenaud, D.: SPOT: an Extensible Model Checking Library using Transition-based General-ized Büchi Automata. In: 12th IEEE/ACM International Symposium on Modeling, Analysis, and Simulation ofComputer and Telecommunication Systems (MASCOTS ’04). pp. 76–83. IEEE Computer Society Press (oct 2004)21. Fahland, D., Favre, C., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Modular Modelling of Software ProductLines with Feature Nets. In: 7 th International Conference on Business Process Management (BPM). LectureNotes in Computer Science, vol. 5701, pp. 278–293. Springer (2009)22. Fronc, L., Duret-Lutz, A.: LTL Model Checking with Neco. In: 11th International Symposium on AutomatedTechnology for Verification and Analysis (ATVA). Lecture Notes in Computer Science, vol. to appear, p. to appear.Springer (Jul 2013) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
23. Fronc, L., Pommereau, F.: Optimizing the Compilation of Petri Net Models. In: Proc. of SUMo’11. vol. 726. CEUR(2011)24. Garavel, H.: Efficient Petri Net tool for computing quasi-liveness, posted at the Petri Net mailing-list ( ) (checked in 2013)25. Hamez, A., Thierry-Mieg, Y., Kordon, F.: Building efficient model checkers using hierarchical set decision dia-grams and automatic saturation. Fundamenta Informaticae 94(3-4), 413–437 (September 2009)26. Heiner, M., Gilbert, D., Donaldson, R.: Petri nets for systems and synthetic biology. In: 8th International Schoolon Formal Methods for the Design of Computer - SFM 2008. LNCS, vol. 5016, pp. 215–264. Springer (2008)27. Heiner, M., Rohr, C., Schwarick, M.: MARCIE - Model Checking and Reachability Analysis Done Efficiently. In:Application and Theory of Petri Nets and Concurrency - 34th International Conference. Lecture Notes in Com-puter Science, vol. 7927, pp. 389–399. Springer (2013)28. Hong, S., Kordon, F., Paviot-Adet, E., Evangelista, S.: Computing a Hierarchical Static order for DecisionDiagram-Based Representation from P/T Nets. ToPNoC: Transactions on Petri Nets and Other Models of Con-currency V (2012)29. Hostettler, S., Marechal, A., Linard, A., Risoldi, M., Buchs, D.: High-Level Petri Net Model Checking with AlPiNA.Fundamenta Informaticae 113 (2011)30. Jorgensen, J., Kristensen, L.: Computer aided verification of Lamport’s fast mutual exclusion algorithm usingcolored Petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Sys-tems 10(7), 714–732 (1999)31. Kordon, F., Gibelin, N., Hulin-Hubard, F., Pommereau, F.: BenchKit User Manual. http://benchkit.cosyverif.org (2013)32. Kordon, F., Linard, A., Beccuti, M., Buchs, D., Fronc, L., Hulin-Hubard, F., Legond-Aubry, F., Lohmann, N.,Marechal, A., Paviot-Adet, E., Pommereau, F., Rodrigues, C., Rohr, C., Thierry-Mieg, Y., Wimmel, H., Wolf, K.:Web Report on the Model Checking Contest @ Petri Net 2013, available at http://mcc.lip6.fr (June 2013)33. 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., Wolf, K.: Raw Report on the Model Checking Contest at Petri Nets2012. Tech. rep., CoRR (September 2012), http://arxiv.org/abs/1209.2382
34. Kordon, F., Linard, A., Buchs, D., Colange, M., Evangelista, S., Lampka, K., Lohmann, N., Paviot-Adet, E., Thierry-Mieg, Y., Wimmel, H.: Report on the Model Checking Contest at Petri Nets 2011. Transactions on Petri Nets andOther Models of Concurrency (ToPNoC) VI, 169–196 (march 2012)35. Kordon, F., Linard, A., Paviot-Adet, E.: Optimized Colored Nets Unfolding. In: 26th International Conference onFormal Methods for Networked and Distributed Systems (FORTE’06). LNCS, vol. 4229, pp. 339–355. Springer,Paris, France (September 2006)36. Krakoviak, S.: Principles of Operating Systems. MIT Press (1988)37. Muschevici, R., Proença, J., Clarke, D.: Modular Modelling of Software Product Lines with Feature Nets. In: 9 th International Conference on Software Engineering and Formal Methods (SEFM). Lecture Notes in ComputerScience, vol. 7041, pp. 318–333. Springer (2011)38. Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115–116 (1981)39. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall (1981)40. Pommereau, F.: SNAKES is the net algebra kit for editors and simulators.
41. Reisig, W.: Elements of Distributed Algorithms. Springer (1998)42. Schwarick, M., Rohr, C., Heiner, M.: MARCIE - Model checking And Reachability analysis done effiCIEntly. In:Proc. 8th International Conference on Quantitative Evaluation of SysTems (QEST 2011). pp. 91 – 100. IEEE CSPress (September 2011)43. Schwarick, M., Tovchigrechko, A.: IDD-based model validation of biochemical networks. TCS 412 pp. 2884–2908(2010)44. Thierry-Mieg, Y., Poitrenaud, D., Hamez, A., Kordon, F.: Hierarchical Set Decision Diagrams and Regular Mod-els. In: 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems(TACAS’09). LNCS, vol. 5505, pp. 1–15. Springer (2009)45. Tovchigrechko, A.: Model Checking Using Interval Decision Diagrams. Ph.D. thesis, BTU Cottbus, Dep. of CS(2008)46. Tricas, F., Ezpeleta, J.: Computing minimal siphons in petri net models of resource allocation systems: a parallelsolution. IEEE Transactions on Systems, Man, and Cybernetics, Part A 36(3), 532–539 (2006)47. Wikipedia: Dining philosophers problem, http://en.wikipedia.org/wiki/Dining_philosophers_problem (checked in 2012)48. Wikipedia: Sieve of eratosthenes, http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes (checked in2012) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al.
49. Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. In: Tools and Algorithms for the Con-struction and Analysis of Systems, 17th International Conference, TACAS 2011. LNCS, vol. 6605, pp. 224–238.Springer (2011)50. Wolf, K.: Generating Petri net state spaces. In: 28th International Conference on Applications and Theory ofPetri Nets and Other Models of Concurrency. LNCS, vol. 4546, pp. 29–42. Springer (Jun 2007) eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. ndex — (cid:77) — (cid:98) MCC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5, 22 (cid:98) (cid:98) (cid:98) (cid:98)
Model (cid:98)
Definition (cid:44) → CSRepetitions . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → Dekker . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → DotAndBoxes . . . . . . . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → DrinkVendingMachine . . . . . . . . . . . . . . . . . 9 (cid:44) → Echo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → Eratosthenes . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 (cid:44) → FMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → GlobalRessAlloc . . . . . . . . . . . . . . . . . . . . . . . . 8 (cid:44) → Kanban . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → LamportFastMutEx . . . . . . . . . . . . . . . . . . . . 8 (cid:44) → MAPK . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → NeoElection . . . . . . . . . . . . . . . . . . . . . . . . . 7, 8 (cid:44) → PermAdmissibility . . . . . . . . . . . . . . . . . . 9, 10 (cid:44) → Peterson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → Philosophers . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → PhilosophersDyn . . . . . . . . . . . . . . . . . . . . . . . 8 (cid:44) → Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7, 8 (cid:44) → Railroad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 (cid:44) → RessAllocation . . . . . . . . . . . . . . . . . . . . . . . . 10 (cid:44) → Ring . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7, 9 (cid:44) → RwMutex . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → SharedMemory . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:44) → SimpleLoadBal . . . . . . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → TokenRing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:98)
Colored (cid:44) → CSRepetitions . 25, 37, 53, 64, 77, 88, 101,112, 125, 130, 143, 154, 167, 178, 193, 202, 214, 223,235, 240, 253, 262, 274, 283, 297, 306, 318, 327, 339,344, 357, 366, 378, 387 (cid:44) → DotAndBoxes . 26, 38, 54, 65, 78, 89, 102,113, 125, 131, 144, 155, 168, 179, 193, 202, 214, 223,235, 241, 253, 262, 274, 283, 297, 306, 318, 327, 339,345, 357, 366, 378, 387 (cid:44) → DrinkVendingMachine 26, 38, 54, 65, 78,89, 102, 113, 125, 131, 144, 155, 168, 179, 193, 202,214, 223, 235, 241, 253, 262, 274, 283, 297, 306, 318,327, 339, 345, 357, 366, 378, 387 (cid:44) → GlobalRessAlloc . . . . 27, 38, 55, 65, 79, 89,103, 113, 126, 131, 145, 155, 169, 179, 195, 203, 216,224, 236, 241, 255, 263, 276, 284, 299, 307, 320, 328,340, 345, 359, 367, 380, 388 (cid:44) → LamportFastMutEx 28, 39, 56, 66, 80, 90,104, 114, 126, 132, 146, 156, 170, 180, 195, 203, 216, 224, 236, 242, 255, 263, 276, 284, 299, 307, 320, 328,340, 346, 359, 367, 380, 388 (cid:44) → NeoElection . . . 29, 39, 57, 66, 81, 90, 105,114, 126, 132, 147, 156, 171, 180, 196, 203, 217, 225,236, 242, 256, 263, 277, 285, 300, 307, 321, 329, 340,346, 360, 367, 381, 389 (cid:44) → PermAdmissibility . 30, 40, 58, 66, 82, 91,106, 115, 127, 133, 148, 156, 172, 180, 196, 204, 217,225, 237, 243, 256, 264, 277, 285, 300, 308, 321, 329,341, 347, 360, 368, 381, 389 (cid:44) → Peterson . 30, 40, 59, 67, 83, 91, 107, 115,127, 133, 149, 157, 172, 181, 197, 204, 218, 225, 237,243, 257, 264, 278, 285, 301, 308, 322, 329, 341, 347,361, 368, 382, 389 (cid:44) → Philosophers . . 31, 40, 59, 67, 83, 91, 107,115, 128, 133, 149, 157, 173, 181, 197, 204, 218, 226,238, 243, 257, 264, 278, 286, 301, 308, 322, 330, 342,347, 361, 368, 382, 390 (cid:44) → PhilosophersDyn . . 32, 41, 60, 67, 84, 92,108, 116, 128, 134, 150, 157, 173, 181, 198, 205, 219,226, 238, 244, 258, 265, 278, 286, 302, 309, 323, 330,342, 348, 362, 369, 382, 390 (cid:44) → SharedMemory . . . . 34, 42, 61, 68, 85, 93,109, 117, 128, 135, 151, 158, 175, 182, 199, 206, 220,227, 238, 245, 259, 266, 280, 287, 303, 310, 324, 331,342, 349, 363, 370, 384, 391 (cid:44) → SimpleLoadBal 34, 42, 62, 69, 86, 93, 110,117, 129, 135, 152, 159, 175, 183, 199, 206, 220, 227,239, 245, 259, 266, 280, 287, 303, 310, 324, 331, 343,349, 363, 370, 384, 391 (cid:44) → TokenRing 35, 42, 62, 69, 86, 93, 110, 117,129, 135, 152, 159, 176, 183, 200, 206, 221, 228, 239,245, 260, 266, 281, 288, 304, 310, 325, 332, 343, 349,364, 370, 385, 392 (cid:98)
P/T (cid:44) → CSRepetitions . 25, 38, 53, 64, 77, 89, 101,113, 125, 131, 143, 154, 167, 178, 193, 202, 214, 223,235, 241, 253, 262, 274, 283, 297, 306, 318, 327, 339,345, 357, 366, 378, 387 (cid:44) → Dekker . . . 25, 38, 53, 64, 77, 89, 101, 113,125, 131, 143, 154, 167, 178, 193, 202, 214, 223, 235,241, 253, 262, 274, 283, 297, 306, 318, 327, 339, 345,357, 366, 378, 387 (cid:44) → DrinkVendingMachine 26, 38, 54, 65, 78,89, 102, 113, 125, 131, 144, 155, 168, 179, 193, 202,214, 223, 235, 241, 253, 262, 274, 283, 297, 306, 318,327, 339, 345, 357, 366, 378, 387 (cid:44) → Eratosthenes . . 26, 38, 55, 65, 79, 89, 103,113, 126, 131, 145, 155, 169, 179, 194, 202, 215, 224,236, 241, 254, 262, 275, 284, 298, 306, 319, 328, 340,345, 358, 366, 379, 388 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → FMS . 27, 38, 55, 65, 79, 89, 103, 113, 126,131, 145, 155, 169, 179, 194, 202, 215, 224, 236, 241,254, 262, 275, 284, 298, 306, 319, 328, 340, 345, 358,366, 379, 388 (cid:44) → GlobalRessAlloc . . . . 27, 39, 56, 65, 80, 90,104, 114, 126, 132, 146, 155, 169, 179, 195, 203, 216,224, 236, 242, 255, 263, 276, 284, 299, 307, 320, 328,340, 346, 359, 367, 380, 388 (cid:44) → Kanban . . . 28, 39, 56, 65, 80, 90, 104, 114,126, 132, 146, 155, 170, 179, 195, 203, 216, 224, 236,242, 255, 263, 276, 284, 299, 307, 320, 328, 340, 346,359, 367, 380, 388 (cid:44) → LamportFastMutEx 28, 39, 57, 66, 81, 90,105, 114, 126, 132, 147, 156, 170, 180, 196, 203, 217,224, 236, 242, 256, 263, 277, 284, 300, 307, 321, 328,340, 346, 360, 367, 381, 388 (cid:44) → MAPK . . . . 29, 39, 57, 66, 81, 90, 105, 114,126, 132, 147, 156, 171, 180, 196, 203, 217, 225, 236,242, 256, 263, 277, 285, 300, 307, 321, 329, 340, 346,360, 367, 381, 389 (cid:44) → NeoElection . . . 29, 39, 58, 66, 82, 90, 106,114, 127, 132, 148, 156, 171, 180, 196, 204, 217, 225,237, 242, 256, 264, 277, 285, 300, 308, 321, 329, 341,346, 360, 368, 381, 389 (cid:44) → PermAdmissibility . 30, 40, 58, 67, 82, 91,106, 115, 127, 133, 148, 157, 172, 180, 197, 204, 218,225, 237, 243, 257, 264, 278, 285, 301, 308, 322, 329,341, 347, 361, 368, 382, 389 (cid:44) → Peterson . 31, 40, 59, 67, 83, 91, 107, 115,127, 133, 149, 157, 173, 181, 197, 204, 218, 225, 237,243, 257, 264, 278, 285, 301, 308, 322, 329, 341, 347,361, 368, 382, 389 (cid:44) → Philosophers . . 31, 40, 59, 67, 83, 91, 107,115, 128, 133, 149, 157, 173, 181, 197, 205, 218, 226,238, 243, 257, 265, 278, 286, 301, 309, 322, 330, 342,347, 361, 369, 382, 390 (cid:44) → PhilosophersDyn . . 32, 41, 60, 68, 84, 92,108, 116, 128, 134, 150, 158, 174, 181, 198, 205, 219,226, 238, 244, 258, 265, 279, 286, 302, 309, 323, 330,342, 348, 362, 369, 383, 390 (cid:44) → Planning . 32, 41, 60, 68, 84, 92, 108, 116,128, 134, 150, 158, 174, 182, 198, 205, 219, 226, 238,244, 258, 265, 279, 286, 302, 309, 323, 330, 342, 348,362, 369, 383, 390 (cid:44) → Railroad . . 32, 41, 60, 68, 84, 92, 108, 116,128, 134, 150, 158, 174, 182, 198, 205, 219, 226, 238,244, 258, 265, 279, 286, 302, 309, 323, 330, 342, 348,362, 369, 383, 390 (cid:44) → RessAllocation 33, 41, 60, 68, 84, 92, 108,116, 128, 134, 150, 158, 174, 182, 198, 205, 219, 226,238, 244, 258, 265, 279, 286, 302, 309, 323, 330, 342,348, 362, 369, 383, 390 (cid:44) → Ring . 33, 41, 61, 68, 85, 92, 109, 116, 128,134, 151, 158, 174, 182, 199, 205, 220, 227, 238, 244,259, 265, 279, 287, 303, 309, 324, 331, 342, 348, 363,369, 383, 391 (cid:44) → RwMutex . 33, 41, 61, 68, 85, 92, 109, 116,128, 134, 151, 158, 175, 182, 199, 205, 220, 227, 238,244, 259, 265, 280, 287, 303, 309, 324, 331, 342, 348,363, 369, 384, 391 (cid:44) → SharedMemory . . . . 34, 42, 61, 69, 85, 93,109, 117, 129, 135, 151, 159, 175, 183, 199, 206, 220,227, 239, 245, 259, 266, 280, 287, 303, 310, 324, 331,343, 349, 363, 370, 384, 391 (cid:44) → SimpleLoadBal 35, 42, 62, 69, 86, 93, 110,117, 129, 135, 152, 159, 176, 183, 200, 206, 221, 228,239, 245, 260, 266, 280, 287, 304, 310, 325, 332, 343,349, 364, 370, 384, 391 (cid:44) → TokenRing 35, 42, 62, 69, 86, 93, 110, 117,129, 135, 152, 159, 176, 183, 200, 206, 221, 228, 239,245, 260, 266, 281, 288, 304, 310, 325, 332, 343, 349,364, 370, 385, 392 (cid:98)
Model (surprise) (cid:98)
Definition (cid:44) → HouseConstruction . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → IBMB2S565S3960 . . . . . . . . . . . . . . . . . . . . . . 9 (cid:44) → QuasiCertifProtocol . . . . . . . . . . . . . . . . 9, 10 (cid:44) → Vasy2003 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 (cid:98)
Colored (cid:44) → QuasiCertifProtocol 36, 43, 63, 69, 87, 94,111, 118, 130, 136, 153, 159, 177, 183, 201, 207, 222,228, 240, 246, 261, 267, 282, 288, 305, 311, 326, 332,344, 350, 365, 371, 386, 392 (cid:98)
P/T (cid:44) → HouseConstruction 36, 42, 63, 69, 87, 93,111, 117, 130, 135, 153, 159, 176, 183, 200, 207, 221,228, 240, 245, 260, 267, 281, 288, 304, 311, 325, 332,344, 349, 364, 371, 385, 392 (cid:44) → IBMB2S565S3960 . . 36, 43, 63, 69, 87, 94,111, 118, 130, 136, 153, 159, 177, 183, 200, 207, 222,228, 240, 246, 260, 267, 281, 288, 304, 311, 326, 332,344, 350, 364, 371, 385, 392 (cid:44) → QuasiCertifProtocol 36, 43, 63, 70, 87, 94,111, 118, 130, 136, 153, 160, 177, 184, 201, 207, 222,228, 240, 246, 261, 267, 282, 288, 305, 311, 326, 332,344, 350, 365, 371, 386, 392 (cid:44) → Vasy2003 . 37, 43, 64, 70, 88, 94, 112, 118,130, 136, 154, 160, 177, 184, 201, 207, 222, 228, 240,246, 261, 267, 282, 288, 305, 311, 326, 332, 344, 350,365, 371, 386, 392 — (cid:79) — (cid:98) Outputs (cid:98)
CTLCardinalityComparison . . . . . . . . . . . . 201 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 202 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 202 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 202 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 202 (cid:44) → DrinkVendingMachine (colored) . . . . 202 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 202 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 202 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 202 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 202 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 203 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 203 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 207 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 207 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 203 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 203 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 203 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 203 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 203 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 204 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 204 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 204 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 204 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 204 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 204 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 205 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 205 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 205 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 205 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 207 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 207 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 205 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 205 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 205 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 206 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 206 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 206 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 206 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 206 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 206 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 207 (cid:98)
CTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 223 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 223 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 223 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 223 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 223 (cid:44) → DrinkVendingMachine (colored) . . . . 223 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 223 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 223 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 224 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 224 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 224 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 224 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 228 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 228 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 224 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 224 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 225 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 225 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 225 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 225 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 225 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 225 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 225 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 225 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 226 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 226 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 226 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 226 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 226 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 228 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 228 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 226 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 226 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 227 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 227 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 227 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 227 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 227 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 228 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 228 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 228 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 228 (cid:98)
CTLMarkingComparison . . . . . . . . . . . . . . 240 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 240 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 241 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 241 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 241 (cid:44) → DrinkVendingMachine (colored) . . . . 241 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 241 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 241 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 242 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 242 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 245 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 246 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 242 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 242 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 242 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 242 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 242 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 242 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 243 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 243 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 243 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 243 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 243 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 243 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 244 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 244 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 244 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 246 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 246 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 244 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 244 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 244 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 244 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 245 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 245 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 245 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 245 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 245 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 245 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 246 (cid:98)
CTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 283 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 283 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 283 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 283 (cid:44) → DrinkVendingMachine (colored) . . . . 283 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 283 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 283 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 284 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 284 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 284 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 284 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 288 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 288 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 284 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 284 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 284 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 285 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 285 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 285 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 285 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 285 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 285 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 285 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 286 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 286 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 286 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 286 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 286 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 288 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 288 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 286 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 286 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 287 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 287 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 287 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 287 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 287 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 288 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 288 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 288 (cid:98)
CTLPlaceComparison . . . . . . . . . . . . . . . . . . 261 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 262 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 262 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 262 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 262 (cid:44) → DrinkVendingMachine (colored) . . . . 262 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 262 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 262 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 262 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 262 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 263 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 263 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 267 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 267 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 263 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 263 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 263 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 263 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 263 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 264 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 264 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 264 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 264 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 264 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 264 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 265 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 265 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 265 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 265 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 267 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 267 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 265 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 265 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 265 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 265 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 266 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 266 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 266 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 266 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 266 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 266 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 267 (cid:98)
LTLCardinalityComparison . . . . . . . . . . . . 305 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 306 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 306 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 306 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 306 (cid:44) → DrinkVendingMachine (colored) . . . . 306 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 306 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 306 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 306 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 306 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 307 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 307 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 311 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 311 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 307 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 307 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 307 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 307 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 307 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 308 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 308 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 308 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 308 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 308 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 308 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 309 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 309 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 309 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 309 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 311 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 311 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 309 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 309 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 309 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 309 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 310 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 310 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 310 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 310 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 310 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 310 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 311 (cid:98)
LTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 327 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 327 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 327 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 327 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 327 (cid:44) → DrinkVendingMachine (colored) . . . . 327 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 327 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 328 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 328 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 328 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 328 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 332 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 332 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 328 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 328 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 329 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 329 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 329 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 329 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 329 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 329 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 329 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 329 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 330 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 330 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 330 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 330 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 330 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 332 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 332 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 330 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 330 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 331 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 331 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 331 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 331 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 331 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 332 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 332 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 332 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 332 (cid:98)
LTLMarkingComparison . . . . . . . . . . . . . . . 344 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 344 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 345 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 345 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 345 (cid:44) → DrinkVendingMachine (colored) . . . . 345 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 345 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 345 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 345 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 345 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 346 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 346 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 349 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 350 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 346 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 346 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 346 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 346 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 346 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 346 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 347 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 347 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 347 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 347 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 347 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 347 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 348 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 348 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 348 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 350 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 350 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 348 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 348 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 348 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 348 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 349 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 349 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 349 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 349 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 349 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 349 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 350 (cid:98)
LTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 387 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 387 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 387 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 387 (cid:44) → DrinkVendingMachine (colored) . . . . 387 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 387 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 387 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 388 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 388 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 388 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 388 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 392 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 392 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 388 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 388 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 388 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 389 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 389 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 389 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 389 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 389 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 389 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 389 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 390 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 390 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 390 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 390 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 390 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 392 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 392 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 390 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 390 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 391 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 391 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 391 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 391 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 391 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 391 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 392 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 392 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 392 (cid:98)
LTLPlaceComparison . . . . . . . . . . . . . . . . . . 365 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 366 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 366 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 366 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 366 (cid:44) → DrinkVendingMachine (colored) . . . . 366 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 366 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 366 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 366 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 366 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 367 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 367 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 371 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 371 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 367 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 367 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 367 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 367 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 367 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 368 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 368 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 368 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 368 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 368 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 368 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 369 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 369 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 369 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 369 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 371 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 371 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 369 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 369 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 369 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 369 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 370 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 370 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 370 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 370 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 370 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 370 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 371 (cid:98)
ReachabilityCardinalityComparison . . . . 64 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 64 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 64 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 64 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 65 (cid:44) → DrinkVendingMachine (colored) . . . . . 65 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 65 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 65 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 65 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 65 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 69 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 69 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 66 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 66 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 66 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 66 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 66 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 66 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 67 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 67 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 67 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 67 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 67 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 67 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 68 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 68 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 69 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 70 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 68 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 68 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 68 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 68 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 69 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 69 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 69 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 69 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 69 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 70 (cid:98)
ReachabilityDeadlock . . . . . . . . . . . . . . . . . . . 88 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 88 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 89 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 89 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 89 (cid:44) → DrinkVendingMachine (colored) . . . . . 89 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 89 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 89 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 90 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 90 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 93 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 94 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 90 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 90 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 90 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 90 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 90 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 90 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 91 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 91 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 91 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 91 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 91 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 91 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 92 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 92 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 92 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 94 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 94 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 92 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 92 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 92 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 93 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 93 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 93 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 93 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 93 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 93 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 94 (cid:98)
ReachabilityFireability . . . . . . . . . . . . . . . . . 112 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 112 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 113 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 113 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 113 (cid:44) → DrinkVendingMachine (colored) . . . . 113 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 113 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 113 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 114 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 114 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 117 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 118 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 114 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 114 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 114 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 114 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 114 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 114 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 115 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 115 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 115 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 115 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 115 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 115 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 116 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 116 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 116 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 118 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 118 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 116 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 116 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 116 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 117 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 117 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 117 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 117 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 117 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 117 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 118 (cid:98)
ReachabilityMarkingComparison . . . . . . 130 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 130 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 131 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 131 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 131 (cid:44) → DrinkVendingMachine (colored) . . . . 131 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 131 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 131 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 132 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 132 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 135 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 136 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 132 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 132 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 132 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 132 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 132 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 132 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 133 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 133 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 133 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 133 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 133 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 133 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 134 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 134 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 134 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 136 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 136 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 134 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 134 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 134 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 135 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 135 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 135 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 135 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 135 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 135 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 136 (cid:98)
ReachabilityMix . . . . . . . . . . . . . . . . . . . . . . . . 178 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 178 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 178 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 178 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 179 (cid:44) → DrinkVendingMachine (colored) . . . . 179 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 179 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 179 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 179 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 179 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 183 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 183 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 179 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 180 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 180 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 180 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 180 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 180 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 180 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 180 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 181 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 181 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 181 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 181 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 181 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 181 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 182 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 183 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 184 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 182 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 182 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 182 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 182 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 182 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 183 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 183 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 183 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 183 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 183 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 184 (cid:98)
ReachabilityPlaceComparison . . . . . . . . . 154 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 154 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 154 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 154 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 155 (cid:44) → DrinkVendingMachine (colored) . . . . 155 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 155 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 155 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 155 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 155 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 159 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 159 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 156 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 156 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 156 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 156 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 156 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 156 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 156 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 157 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 157 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 157 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 157 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 157 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 157 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 158 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 158 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 159 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 160 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 158 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 158 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 158 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 158 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 159 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 159 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 159 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 159 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 159 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 160 (cid:98)
StateSpace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 37 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 38 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 38 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 38 (cid:44) → DrinkVendingMachine (colored) . . . . . 38 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 38 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 38 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 39 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 39 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 42 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 43 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 39 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 39 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 39 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 39 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 39 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 40 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 40 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 40 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 40 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 40 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 40 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 41 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 41 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 41 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 43 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 43 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 41 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 41 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 41 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 42 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 42 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 42 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 42 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 42 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 42 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 43 — (cid:80) — (cid:98) Performances (cid:98)
CTLCardinalityComparison . . . . . . . . . . . . 193 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 193 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 193 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 193 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 194 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 195 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 200 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 200 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 195 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 196 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 196 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 196 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 197 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 197 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 197 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 198 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 201 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 198 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 198 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 199 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 199 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 199 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 200 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 201 (cid:98)
CTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 214 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 214 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 214 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 214 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 215 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 216 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 221 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 222 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 216 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 217 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 217 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 217 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 218 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 218 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 218 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 219 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 222 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 219 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 219 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 220 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 220 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 221 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 221 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 222 (cid:98)
CTLMarkingComparison . . . . . . . . . . . . . . 235 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 235 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 235 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 236 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 236 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 237 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 237 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 237 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 238 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 238 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 240 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 239 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 239 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 239 (cid:98)
CTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 274 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 274 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 274 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 275 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 276 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 281 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 281 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 276 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 277 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 277 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 277 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 278 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 278 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 278 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 279 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 282 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 279 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 279 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 280 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 280 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 280 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 281 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 282 (cid:98)
CTLPlaceComparison . . . . . . . . . . . . . . . . . . 253 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 253 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 253 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 253 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 254 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 255 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 260 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 260 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 255 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 256 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 256 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 256 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 257 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 257 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 257 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 258 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 261 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 258 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 258 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 259 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 259 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 259 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 260 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 261 (cid:98)
LTLCardinalityComparison . . . . . . . . . . . . 297 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 297 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 297 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 297 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 298 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 298 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 298 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 299 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 304 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 304 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 299 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 300 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 300 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 300 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 301 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 301 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 301 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 302 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 305 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 302 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 302 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 303 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 303 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 304 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 305 (cid:98)
LTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 318 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 318 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 318 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 318 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 319 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 319 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 319 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 320 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 325 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 326 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 320 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 321 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 321 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 321 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 322 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 322 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 322 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 323 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 326 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 323 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 323 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 324 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 324 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 324 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 325 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 325 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 326 (cid:98)
LTLMarkingComparison . . . . . . . . . . . . . . . 339 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 339 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 339 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 340 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 340 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 341 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 341 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 341 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 342 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 342 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 344 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 343 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 343 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 343 (cid:98)
LTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 378 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 378 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 378 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 379 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 379 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 379 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 380 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 385 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 385 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 380 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 381 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 381 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 381 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 382 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 382 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 382 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 383 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 386 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 383 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 383 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 383 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 384 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 384 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 384 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 385 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 386 (cid:98)
LTLPlaceComparison . . . . . . . . . . . . . . . . . . 357 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 357 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 357 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 357 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 358 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 359 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 364 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 364 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 359 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 360 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 360 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 360 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 361 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 361 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 361 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 362 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 365 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 362 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 362 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 363 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 363 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 363 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 364 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 365 (cid:98)
ReachabilityCardinalityComparison . . . . 53 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . . 53 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 53 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 53 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . . 54 (cid:44) → DrinkVendingMachine (Colored) . . . . . 54 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 54 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 55 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 (cid:44) → GlobalRessAlloc (Colored) . . . . . . . . . . . . 55 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 56 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 63 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 63 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 56 (cid:44) → LamportFastMutEx (Colored) . . . . . . . . 56 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 57 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . . 57 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 58 (cid:44) → PermAdmissibility (Colored) . . . . . . . . . 58 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 58 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . . . 59 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 59 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 59 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 60 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 63 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 60 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 60 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 61 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 61 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . . 62 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 62 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 64 (cid:98)
ReachabilityDeadlock . . . . . . . . . . . . . . . . . . . 77 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . . 77 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 77 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 77 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . . 78 (cid:44) → DrinkVendingMachine (Colored) . . . . . 78 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 78 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 79 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 (cid:44) → GlobalRessAlloc (Colored) . . . . . . . . . . . . 79 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 80 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 87 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 87 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 80 (cid:44) → LamportFastMutEx (Colored) . . . . . . . . 80 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 81 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 81 (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . . 81 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 82 (cid:44) → PermAdmissibility (Colored) . . . . . . . . . 82 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 82 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . . . 83 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 83 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 83 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 84 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 87 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 84 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 84 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 85 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 85 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . . 86 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 86 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 86 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 88 (cid:98)
ReachabilityFireability . . . . . . . . . . . . . . . . . 101 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . 101 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 101 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 101 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . 102 (cid:44) → DrinkVendingMachine (Colored) . . . 102 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 102 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 103 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 (cid:44) → GlobalRessAlloc (Colored) . . . . . . . . . . . 103 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 104 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 111 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 111 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 104 (cid:44) → LamportFastMutEx (Colored) . . . . . . . 104 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 105 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 105 (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . 105 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 106 (cid:44) → PermAdmissibility (Colored) . . . . . . . . 106 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 106 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . 107 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 107 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 107 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 108 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 111 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 108 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 108 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 109 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 109 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . 110 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 110 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 110 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 112 (cid:98)
ReachabilityMarkingComparison . . . . . . 125 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 125 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 125 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 126 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 126 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 127 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 127 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 127 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 128 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 128 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 130 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 129 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 129 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 129 (cid:98)
ReachabilityMix . . . . . . . . . . . . . . . . . . . . . . . . 167 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . 167 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 167 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 167 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . 168 (cid:44) → DrinkVendingMachine (Colored) . . . 168 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 168 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 168 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 169 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 169 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 169 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 176 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 177 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 170 (cid:44) → LamportFastMutEx (Colored) . . . . . . . 170 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 170 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 171 (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . 171 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 171 (cid:44) → PermAdmissibility (Colored) . . . . . . . . 172 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 172 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . 172 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 173 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 173 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 174 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 177 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 174 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 174 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 174 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 175 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 175 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . 175 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 176 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 176 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 177 (cid:98)
ReachabilityPlaceComparison . . . . . . . . . 143 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . 143 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 143 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 143 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . 144 (cid:44) → DrinkVendingMachine (Colored) . . . 144 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 144 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 144 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 145 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 (cid:44) → GlobalRessAlloc (Colored) . . . . . . . . . . . 145 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 146 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 153 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 153 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 146 (cid:44) → LamportFastMutEx (Colored) . . . . . . . 146 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 147 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 147 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . 147 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 148 (cid:44) → PermAdmissibility (Colored) . . . . . . . . 148 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 148 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . 149 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 149 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 149 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 150 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 153 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 150 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 150 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 151 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 151 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 151 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . 152 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 152 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 154 (cid:98)
StateSpace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 (cid:44) → CSRepetitions (Colored) . . . . . . . . . . . . . . 25 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 25 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 25 (cid:44) → DotAndBoxes (Colored) . . . . . . . . . . . . . . 26 (cid:44) → DrinkVendingMachine (Colored) . . . . . 26 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 26 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 26 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (cid:44) → GlobalRessAlloc (Colored) . . . . . . . . . . . . 27 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 27 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 36 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 36 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 28 (cid:44) → LamportFastMutEx (Colored) . . . . . . . . 28 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 28 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (cid:44) → NeoElection (Colored) . . . . . . . . . . . . . . . . 29 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 29 (cid:44) → PermAdmissibility (Colored) . . . . . . . . . 30 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 30 (cid:44) → Peterson (Colored) . . . . . . . . . . . . . . . . . . . . 30 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 31 (cid:44) → Philosophers (Colored) . . . . . . . . . . . . . . . 31 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 31 (cid:44) → PhilosophersDyn (Colored) . . . . . . . . . . . 32 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 32 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 36 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 32 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 33 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 33 (cid:44) → SharedMemory (Colored) . . . . . . . . . . . . . 34 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 34 (cid:44) → SimpleLoadBal (Colored) . . . . . . . . . . . . . 34 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 35 (cid:44) → TokenRing (Colored) . . . . . . . . . . . . . . . . . . 35 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 35 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 37 — (cid:82) — (cid:98) Results (cid:98)
CTLCardinalityComparison . . . . . . . . . . . . 193 (cid:98)
CTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 214 (cid:98)
CTLMarkingComparison . . . . . . . . . . . . . . 235 (cid:98)
CTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274 (cid:98)
CTLPlaceComparison . . . . . . . . . . . . . . . . . . 253 (cid:98)
LTLCardinalityComparison . . . . . . . . . . . . 297 (cid:98)
LTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 318 (cid:98)
LTLMarkingComparison . . . . . . . . . . . . . . . 339 (cid:98)
LTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378 (cid:98)
LTLPlaceComparison . . . . . . . . . . . . . . . . . . 357 (cid:98)
ReachabilityCardinalityComparison . . . . 53 (cid:98)
ReachabilityDeadlock . . . . . . . . . . . . . . . . . . . 77 (cid:98)
ReachabilityFireability . . . . . . . . . . . . . . . . . 101 (cid:98)
ReachabilityMarkingComparison . . . . . . 125 (cid:98)
ReachabilityMix . . . . . . . . . . . . . . . . . . . . . . . . 167 (cid:98)
ReachabilityPlaceComparison . . . . . . . . . 143 (cid:98)
StateSpace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 — (cid:83) — (cid:98) Scores (cid:98)
CTLCardinalityComparison . . . . . . . . . . . . 207 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 208 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 208 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 208 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 208 (cid:44) → DrinkVendingMachine (colored) . . . . 208 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 208 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 208 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 208 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 208 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 209 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 209 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 212 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 212 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 209 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 209 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 209 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 209 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 209 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 209 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 210 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 210 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 210 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 210 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 210 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 210 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 210 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 210 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 210 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 212 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 212 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 211 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 211 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 211 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 211 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 211 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 211 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 211 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 212 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 212 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 212 (cid:98)
CTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 229 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 229 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 229 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 229 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 229 (cid:44) → DrinkVendingMachine (colored) . . . . 229 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 229 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 230 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 230 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 230 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 230 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 230 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 233 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 233 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 230 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 230 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 230 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 230 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 231 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 231 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 231 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 231 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 231 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 231 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 231 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 231 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 232 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 232 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 232 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 233 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 234 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 232 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 232 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 232 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 232 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 232 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 232 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 233 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 233 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 233 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 233 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 234 (cid:98)
CTLMarkingComparison . . . . . . . . . . . . . . 246 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 246 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 247 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 247 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 247 (cid:44) → DrinkVendingMachine (colored) . . . . 247 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 247 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 247 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 247 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 247 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 247 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 248 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 251 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 251 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 248 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 248 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 248 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 248 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 248 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 248 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 248 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 249 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 249 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 249 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 249 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 249 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 249 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 249 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 249 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 251 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 251 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 249 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 250 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 250 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 250 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 250 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 250 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 250 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 250 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 250 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 250 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 251 (cid:98)
CTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 289 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 289 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 289 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 289 (cid:44) → DrinkVendingMachine (colored) . . . . 289 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 289 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 289 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 290 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 290 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 290 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 290 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 293 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 293 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 290 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 290 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 290 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 290 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 290 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 291 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 291 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 291 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 291 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 291 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 291 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 291 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 291 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 292 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 292 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 293 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 293 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 292 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 292 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 292 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 292 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 292 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 292 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 292 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 293 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 293 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 293 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 294 (cid:98)
CTLPlaceComparison . . . . . . . . . . . . . . . . . . 267 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 268 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 268 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 268 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 268 (cid:44) → DrinkVendingMachine (colored) . . . . 268 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 268 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 268 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 268 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 268 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 269 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 269 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 272 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 272 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 269 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 269 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 269 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 269 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 269 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 269 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 270 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 270 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 270 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 270 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 270 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 270 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 270 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 270 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 270 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 272 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 272 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 271 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 271 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 271 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 271 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 271 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 271 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 271 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 271 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 272 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 272 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 272 (cid:98)
LTLCardinalityComparison . . . . . . . . . . . . 311 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 312 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 312 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 312 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 312 (cid:44) → DrinkVendingMachine (colored) . . . . 312 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 312 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 312 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 312 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 312 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 313 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 313 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 316 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 316 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 313 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 313 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 313 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 313 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 313 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 313 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 314 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 314 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 314 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 314 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 314 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 314 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 314 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 314 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 314 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 316 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 316 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 315 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 315 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 315 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 315 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 315 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 315 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 315 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 315 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 316 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 316 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 316 (cid:98)
LTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 333 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 333 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 333 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 333 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 333 (cid:44) → DrinkVendingMachine (colored) . . . . 333 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 333 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 334 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 334 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 334 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 337 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 337 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 334 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 334 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 334 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 334 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 335 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 335 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 335 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 335 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 335 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 335 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 335 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 335 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 336 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 336 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 336 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 337 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 338 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 336 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 336 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 336 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 336 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 336 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 337 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 337 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 337 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 337 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 338 (cid:98)
LTLMarkingComparison . . . . . . . . . . . . . . . 350 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 350 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 351 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 351 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 351 (cid:44) → DrinkVendingMachine (colored) . . . . 351 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 351 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 351 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 351 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 351 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 351 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 352 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 355 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 355 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 352 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 352 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 352 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 352 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 352 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 352 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 352 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 353 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 353 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 353 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 353 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 353 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 353 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 353 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 353 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 355 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 355 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 353 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 354 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 354 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 354 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 354 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 354 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 354 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 354 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 354 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 354 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 355 (cid:98)
LTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 392 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 393 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 393 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 393 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 393 (cid:44) → DrinkVendingMachine (colored) . . . . 393 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 393 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 393 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 394 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 394 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 394 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 394 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 397 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 397 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 394 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 394 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 394 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 394 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 394 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 395 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 395 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 395 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 395 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 395 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 395 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 395 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 395 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 396 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 396 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 397 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 397 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 396 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 396 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 396 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 396 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 396 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 396 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 397 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 397 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 397 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 398 (cid:98)
LTLPlaceComparison . . . . . . . . . . . . . . . . . . 371 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 372 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 372 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 372 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 372 (cid:44) → DrinkVendingMachine (colored) . . . . 372 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 372 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 372 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 372 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 372 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 373 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 373 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 376 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 376 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 373 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 373 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 373 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 373 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 373 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 373 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 374 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 374 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 374 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 374 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 374 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 374 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 374 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 374 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 374 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 376 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 376 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 375 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 375 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 375 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 375 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 375 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 375 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 375 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 375 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 376 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 376 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 376 (cid:98)
ReachabilityCardinalityComparison . . . . 70 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 70 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 70 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 70 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 71 (cid:44) → DrinkVendingMachine (colored) . . . . . 71 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 71 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 71 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 71 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 71 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 74 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 75 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 71 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 72 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 72 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 72 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 72 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 72 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 72 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 72 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 73 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 73 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 73 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 73 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 73 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 73 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 75 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 75 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 73 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 73 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 74 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 74 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 74 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 74 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 74 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 74 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 74 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 75 (cid:98)
ReachabilityDeadlock . . . . . . . . . . . . . . . . . . . 94 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 94 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 95 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 95 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 95 (cid:44) → DrinkVendingMachine (colored) . . . . . 95 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 95 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 95 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 95 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 96 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 99 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 99 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 96 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 96 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 96 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 96 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 96 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 96 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 97 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 97 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 97 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 97 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 97 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 97 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 97 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 97 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 99 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 99 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 97 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 98 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 98 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 98 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 98 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 98 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 98 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 98 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 98 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 99 (cid:98)
ReachabilityFireability . . . . . . . . . . . . . . . . . 118 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 118 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 119 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 119 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 119 (cid:44) → DrinkVendingMachine (colored) . . . . 119 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 119 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 119 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 119 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 120 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 123 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 123 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 120 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 120 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 120 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 120 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 120 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 120 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 120 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 121 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 121 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 121 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 121 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 121 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 121 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 121 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 121 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 123 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 123 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 121 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 122 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 122 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 122 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 122 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 122 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 122 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 122 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 122 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 123 (cid:98)
ReachabilityMarkingComparison . . . . . . 136 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 136 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 137 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 137 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 137 (cid:44) → DrinkVendingMachine (colored) . . . . 137 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 137 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 137 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 137 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 138 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 141 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 141 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 138 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 138 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 138 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 138 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 138 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 138 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 138 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 139 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 139 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 139 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 139 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 139 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 139 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 139 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 139 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 141 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 141 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 139 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 140 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 140 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 140 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 140 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 140 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 140 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 140 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 140 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 141 (cid:98)
ReachabilityMix . . . . . . . . . . . . . . . . . . . . . . . . 184 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 184 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 184 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 184 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 184 (cid:44) → DrinkVendingMachine (colored) . . . . 185 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 185 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 185 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 185 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 185 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 185 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 185 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 188 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 189 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 185 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 186 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 186 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 186 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 186 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 186 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 186 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 186 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 186 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 186 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 187 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 187 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 187 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 187 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 187 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 189 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 189 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 187 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 187 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 188 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 188 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 188 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 188 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 188 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 188 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 188 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 189 (cid:98)
ReachabilityPlaceComparison . . . . . . . . . 160 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . 160 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . 160 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 160 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . 161 (cid:44) → DrinkVendingMachine (colored) . . . . 161 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . 161 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 161 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . 161 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 161 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . 161 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . 161 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . 164 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . 165 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 161 (cid:44) → LamportFastMutEx (colored) . . . . . . . . 162 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . 162 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 162 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . 162 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . 162 (cid:44) → PermAdmissibility (colored) . . . . . . . . . 162 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . 162 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . 162 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . 163 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . 163 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . 163 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . 163 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . 163 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . 163 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . 165 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . 165 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . 163 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . 163 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . 164 (cid:44) → SharedMemory (colored) . . . . . . . . . . . . 164 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . 164 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . 164 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . 164 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . 164 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . 164 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . 165 (cid:98)
StateSpace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 (cid:44) → CSRepetitions (colored) . . . . . . . . . . . . . . 43 (cid:44) → CSRepetitions (P/T) . . . . . . . . . . . . . . . . . . 44 (cid:44) → Dekker (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . 44 (cid:44) → DotAndBoxes (colored) . . . . . . . . . . . . . . . 44 (cid:44) → DrinkVendingMachine (colored) . . . . . 44 (cid:44) → DrinkVendingMachine (P/T) . . . . . . . . . 44 (cid:44) → Echo (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 (cid:44) → Eratosthenes (P/T) . . . . . . . . . . . . . . . . . . . . 44 (cid:44) → FMS (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 (cid:44) → GlobalRessAlloc (colored) . . . . . . . . . . . . 44 (cid:44) → GlobalRessAlloc (P/T) . . . . . . . . . . . . . . . . 45 (cid:44) → HouseConstruction (P/T) . . . . . . . . . . . . 48 (cid:44) → IBMB2S565S3960 (P/T) . . . . . . . . . . . . . . . 48 (cid:44) → Kanban (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . 45 (cid:44) → LamportFastMutEx (colored) . . . . . . . . . 45 (cid:44) → LamportFastMutEx (P/T) . . . . . . . . . . . . . 45 (cid:44) → MAPK (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 (cid:44) → NeoElection (colored) . . . . . . . . . . . . . . . . 45 (cid:44) → NeoElection (P/T) . . . . . . . . . . . . . . . . . . . . 45 (cid:44) → PermAdmissibility (colored) . . . . . . . . . . 45 (cid:44) → PermAdmissibility (P/T) . . . . . . . . . . . . . . 46 (cid:44) → Peterson (colored) . . . . . . . . . . . . . . . . . . . . 46 (cid:44) → Peterson (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 46 (cid:44) → Philosophers (colored) . . . . . . . . . . . . . . . 46 (cid:44) → Philosophers (P/T) . . . . . . . . . . . . . . . . . . . 46 (cid:44) → PhilosophersDyn (colored) . . . . . . . . . . . 46 (cid:44) → PhilosophersDyn (P/T) . . . . . . . . . . . . . . . 46 (cid:44) → Planning (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 46 (cid:44) → QuasiCertifProtocol (colored) . . . . . . . . 48 (cid:44) → QuasiCertifProtocol (P/T) . . . . . . . . . . . . 48 (cid:44) → Railroad (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 46 (cid:44) → RessAllocation (P/T) . . . . . . . . . . . . . . . . . . 47 (cid:44) → Ring (P/T) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 (cid:44) → RwMutex (P/T) . . . . . . . . . . . . . . . . . . . . . . . 47 eport on the Model Checking Contest @ Petri Nets 2013 F. Kordon, A. Linard et. al. (cid:44) → SharedMemory (colored) . . . . . . . . . . . . . 47 (cid:44) → SharedMemory (P/T) . . . . . . . . . . . . . . . . . 47 (cid:44) → SimpleLoadBal (colored) . . . . . . . . . . . . . 47 (cid:44) → SimpleLoadBal (P/T) . . . . . . . . . . . . . . . . . 47 (cid:44) → TokenRing (colored) . . . . . . . . . . . . . . . . . . 47 (cid:44) → TokenRing (P/T) . . . . . . . . . . . . . . . . . . . . . . 47 (cid:44) → Vasy2003 (P/T) . . . . . . . . . . . . . . . . . . . . . . . . 48 — (cid:84) — (cid:98) Tool (cid:98)
AlPiNA . . . . . . . . . . . . . . . . . . . . iii, 13, 22, 37–48 (cid:98)
Cunf . . . . . . . . . . . . . . . . . . . . . . . iii, 13, 22, 88–99 (cid:98)
GreatSPN iii, 7, 14, 22, 37–47, 64–74, 88–98,112–122, 130–140, 154–164, 178–188, 202–212,223–233, 240–250, 262–272, 283–293 (cid:98)
ITS-Tools . . . iii, 14, 22, 37–49, 64–74, 88–98,112–122, 124, 154–164, 178–188 (cid:98)
LoLA . . . iii, 14, 22, 64–76, 88–100, 112–124,130–142, 154–166, 178–190, 202–213, 223–234,240–252, 262–273, 283–294, 306–316, 327–338,344–355, 366–376, 387–398 (cid:44) → (optimistic) . 15, 64–76, 88–100, 112–124,130–142, 154–166, 178–190, 202–213, 223–234,240–252, 262–273, 283–294, 306–316, 327–338,344–355, 366–376, 387–398 (cid:44) → (pessimistic) . . . 15, 37–47, 64–75, 88–99,112–123, 130–141, 154–165, 178–189, 202–212,223–234, 240–251, 262–272, 283–294, 306–316,327–338, 344–355, 366–376, 387–398 (cid:44) → optimistic incomplete 15, 64–76, 88–100,112–124, 130–141, 154–165, 178–190, 202–212, 223–234, 240–251, 262–273, 283–294, 306–316,327–338, 344–355, 366–376, 387–398 (cid:98) Marcie . . . . . iii, 15, 22, 37–49, 64–76, 88–99,112–124, 130–142, 154–166, 178–190, 202–213,223–234, 240–252, 262–273, 283–294 (cid:98)
Neco . . iii, 15, 22, 37–48, 306–317, 327–338,344–356, 366–377, 387–398 (cid:98)
PNXDD . . . . . . . . . . . . . . . . . . . . iii, 16, 22, 37–49 (cid:98)
Sara . . . . iii, 16, 22, 64–75, 88–100, 112–123,130–142, 154–165, 178–189, 202–212, 223–234,240–252, 262–272, 283–294, 306–316, 327–338,344–355, 366–376, 387–398 (cid:98)
SMART . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 (cid:98)
Trophies (cid:98)
CTLCardinalityComparison . . . . . . . . . . . . 212 (cid:98)
CTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 234 (cid:98)
CTLMarkingComparison . . . . . . . . . . . . . . 251 (cid:98)
CTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294 (cid:98)
CTLPlaceComparison . . . . . . . . . . . . . . . . . . 272 (cid:98)
LTLCardinalityComparison . . . . . . . . . . . . 316 (cid:98)
LTLFireability . . . . . . . . . . . . . . . . . . . . . . . . . . 338 (cid:98)
LTLMarkingComparison . . . . . . . . . . . . . . . 355 (cid:98)
LTLMix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398 (cid:98)
LTLPlaceComparison . . . . . . . . . . . . . . . . . . 376 (cid:98)
ReachabilityCardinalityComparison . . . . 75 (cid:98)
ReachabilityDeadlock . . . . . . . . . . . . . . . . . . . 99 (cid:98)
ReachabilityFireability . . . . . . . . . . . . . . . . . 123 (cid:98)
ReachabilityMarkingComparison . . . . . . 141 (cid:98)
ReachabilityMix . . . . . . . . . . . . . . . . . . . . . . . . 189 (cid:98)
ReachabilityPlaceComparison . . . . . . . . . 165 (cid:98)