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

Introduction

This page presents how GreatSPN-Meddly do cope efficiently with the ReachabilityBounds 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 GreatSPN-Meddly' 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).

GreatSPN-Meddly versus LoLA2.0

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to LoLA2.0 are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly LoLA2.0 Both tools   GreatSPN-Meddly LoLA2.0
Computed OK 5 382 230   Smallest Memory Footprint
Do not compete 0 73 228 Times tool wins 58 559
Error detected 112 5 4   Shortest Execution Time
Cannot Compute + Time-out 343 0 7 Times tool wins 84 533


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

GreatSPN-Meddly versus LTSMin

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to LTSMin are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly LTSMin Both tools   GreatSPN-Meddly LTSMin
Computed OK 235 0 0   Smallest Memory Footprint
Do not compete 228 626 0 Times tool wins 235 0
Error detected 116 0 0   Shortest Execution Time
Cannot Compute + Time-out 275 228 75 Times tool wins 235 0


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

GreatSPN-Meddly versus Marcie

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to Marcie are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly Marcie Both tools   GreatSPN-Meddly Marcie
Computed OK 33 191 202   Smallest Memory Footprint
Do not compete 228 0 0 Times tool wins 235 191
Error detected 95 9 21   Shortest Execution Time
Cannot Compute + Time-out 118 274 232 Times tool wins 167 259


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

GreatSPN-Meddly versus TAPAAL(MC)

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to TAPAAL(MC) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly TAPAAL(MC) Both tools   GreatSPN-Meddly TAPAAL(MC)
Computed OK 89 235 146   Smallest Memory Footprint
Do not compete 0 73 228 Times tool wins 154 316
Error detected 116 0 0   Shortest Execution Time
Cannot Compute + Time-out 194 91 156 Times tool wins 150 320


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

GreatSPN-Meddly versus TAPAAL(SEQ)

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to TAPAAL(SEQ) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly TAPAAL(SEQ) Both tools   GreatSPN-Meddly TAPAAL(SEQ)
Computed OK 0 383 235   Smallest Memory Footprint
Do not compete 0 73 228 Times tool wins 127 491
Error detected 116 0 0   Shortest Execution Time
Cannot Compute + Time-out 340 0 10 Times tool wins 156 462


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

GreatSPN-Meddly versus TAPAAL-OTF(PAR)

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to TAPAAL-OTF(PAR) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly TAPAAL-OTF(PAR) Both tools   GreatSPN-Meddly TAPAAL-OTF(PAR)
Computed OK 110 67 125   Smallest Memory Footprint
Do not compete 0 73 228 Times tool wins 177 125
Error detected 116 22 0   Shortest Execution Time
Cannot Compute + Time-out 116 180 234 Times tool wins 172 130


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

GreatSPN-Meddly versus TAPAAL-OTF(SEQ)

Some statistics are displayed below, based on 1858 runs (929 for GreatSPN-Meddly 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 GreatSPN-Meddly to TAPAAL-OTF(SEQ) are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly TAPAAL-OTF(SEQ) Both tools   GreatSPN-Meddly TAPAAL-OTF(SEQ)
Computed OK 110 67 125   Smallest Memory Footprint
Do not compete 0 73 228 Times tool wins 179 123
Error detected 116 22 0   Shortest Execution Time
Cannot Compute + Time-out 116 180 234 Times tool wins 174 128


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