fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Cunf compared to other tools («All» models, ReachabilityFireability)
Last Updated
August 19, 2015

Introduction

This page presents how Cunf do cope efficiently with the ReachabilityFireability examination face to the other participating tools. In this page, we consider «All» models.

The next sections will show chart comparing performances in termsof both memory and execution time.The x-axis corresponds to the challenging tool where the y-axes represents Cunf' performances. Thus, points below the diagonal of a chart denote comparisons favorables to the tool whileothers corresponds to situations where the challenging tool performs better.

You might also find plots out of the range that denote the case were at least one tool could not answer appropriately (error, time-out, could not compute or did not competed).

Cunf versus GreatSPN-Meddly

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for GreatSPN-Meddly, so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to GreatSPN-Meddly are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf GreatSPN-Meddly Both tools   Cunf GreatSPN-Meddly
Computed OK 140 73 12   Smallest Memory Footprint
Do not compete 424 0 228 Times tool wins 152 73
Error detected 1 218 6   Shortest Execution Time
Cannot Compute + Time-out 16 290 102 Times tool wins 152 73


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus ITS-Tools

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for ITS-Tools, so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to ITS-Tools are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf ITS-Tools Both tools   Cunf ITS-Tools
Computed OK 103 402 49   Smallest Memory Footprint
Do not compete 652 0 0 Times tool wins 142 412
Error detected 4 273 3   Shortest Execution Time
Cannot Compute + Time-out 81 165 37 Times tool wins 140 414


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus LoLA2.0

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for LoLA2.0, so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to LoLA2.0 are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf LoLA2.0 Both tools   Cunf LoLA2.0
Computed OK 2 461 150   Smallest Memory Footprint
Do not compete 351 0 301 Times tool wins 124 489
Error detected 7 10 0   Shortest Execution Time
Cannot Compute + Time-out 113 2 5 Times tool wins 145 468


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus LTSMin

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for LTSMin, so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to LTSMin are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf LTSMin Both tools   Cunf LTSMin
Computed OK 0 456 152   Smallest Memory Footprint
Do not compete 652 0 0 Times tool wins 146 462
Error detected 7 16 0   Shortest Execution Time
Cannot Compute + Time-out 114 301 4 Times tool wins 147 461


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus Marcie

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for Marcie, so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to Marcie are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf Marcie Both tools   Cunf Marcie
Computed OK 28 281 124   Smallest Memory Footprint
Do not compete 652 0 0 Times tool wins 152 281
Error detected 7 1 0   Shortest Execution Time
Cannot Compute + Time-out 33 438 85 Times tool wins 151 282


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus TAPAAL(MC)

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for TAPAAL(MC), so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to TAPAAL(MC) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf TAPAAL(MC) Both tools   Cunf TAPAAL(MC)
Computed OK 10 414 142   Smallest Memory Footprint
Do not compete 351 0 301 Times tool wins 144 422
Error detected 7 15 0   Shortest Execution Time
Cannot Compute + Time-out 96 35 22 Times tool wins 135 431


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus TAPAAL(SEQ)

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for TAPAAL(SEQ), so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to TAPAAL(SEQ) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf TAPAAL(SEQ) Both tools   Cunf TAPAAL(SEQ)
Computed OK 0 462 152   Smallest Memory Footprint
Do not compete 351 0 301 Times tool wins 112 502
Error detected 7 2 0   Shortest Execution Time
Cannot Compute + Time-out 110 4 8 Times tool wins 134 480


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus TAPAAL-OTF(PAR)

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for TAPAAL-OTF(PAR), so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to TAPAAL-OTF(PAR) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf TAPAAL-OTF(PAR) Both tools   Cunf TAPAAL-OTF(PAR)
Computed OK 74 92 78   Smallest Memory Footprint
Do not compete 351 0 301 Times tool wins 141 103
Error detected 7 40 0   Shortest Execution Time
Cannot Compute + Time-out 0 300 118 Times tool wins 139 105


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

Cunf versus TAPAAL-OTF(SEQ)

Some statistics are displayed below, based on 1858 runs (929 for Cunf and 929 for TAPAAL-OTF(SEQ), so there are 929 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing Cunf to TAPAAL-OTF(SEQ) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  Cunf TAPAAL-OTF(SEQ) Both tools   Cunf TAPAAL-OTF(SEQ)
Computed OK 41 201 111   Smallest Memory Footprint
Do not compete 351 0 301 Times tool wins 150 203
Error detected 7 2 0   Shortest Execution Time
Cannot Compute + Time-out 22 218 96 Times tool wins 137 216


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart