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

Introduction

This page presents how GreatSPN-Meddly do cope efficiently with the ReachabilityDeadlock examination face to the other participating tools. In this page, we consider «Known» 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 Cunf

Some statistics are displayed below, based on 808 runs (404 for GreatSPN-Meddly and 404 for Cunf, so there are 404 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 Cunf are shown (you may click on one graph to enlarge it).

Statistics on the execution
  GreatSPN-Meddly Cunf Both tools   GreatSPN-Meddly Cunf
Computed OK 93 24 49   Smallest Memory Footprint
Do not compete 0 163 114 Times tool wins 94 72
Error detected 0 2 0   Shortest Execution Time
Cannot Compute + Time-out 103 7 45 Times tool wins 94 72


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 LoLA2.0

Some statistics are displayed below, based on 808 runs (404 for GreatSPN-Meddly and 404 for LoLA2.0, so there are 404 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 8 103 134   Smallest Memory Footprint
Do not compete 0 23 114 Times tool wins 38 207
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 126 8 22 Times tool wins 34 211


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 808 runs (404 for GreatSPN-Meddly and 404 for LTSMin, so there are 404 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 43 46 99   Smallest Memory Footprint
Do not compete 114 0 0 Times tool wins 130 58
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 46 157 102 Times tool wins 103 85


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 808 runs (404 for GreatSPN-Meddly and 404 for Marcie, so there are 404 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 44 74 98   Smallest Memory Footprint
Do not compete 114 0 0 Times tool wins 141 75
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 47 131 101 Times tool wins 107 109


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 808 runs (404 for GreatSPN-Meddly and 404 for TAPAAL(MC), so there are 404 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 31 46 111   Smallest Memory Footprint
Do not compete 0 23 114 Times tool wins 50 138
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 69 31 79 Times tool wins 49 139


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 808 runs (404 for GreatSPN-Meddly and 404 for TAPAAL(SEQ), so there are 404 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 122 142   Smallest Memory Footprint
Do not compete 0 23 114 Times tool wins 42 222
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 145 0 3 Times tool wins 48 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

GreatSPN-Meddly versus TAPAAL-OTF(PAR)

Some statistics are displayed below, based on 808 runs (404 for GreatSPN-Meddly and 404 for TAPAAL-OTF(PAR), so there are 404 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 58 27 84   Smallest Memory Footprint
Do not compete 0 23 114 Times tool wins 96 73
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 50 58 98 Times tool wins 89 80


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 808 runs (404 for GreatSPN-Meddly and 404 for TAPAAL-OTF(SEQ), so there are 404 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 12 79 130   Smallest Memory Footprint
Do not compete 0 23 114 Times tool wins 76 145
Error detected 0 10 0   Shortest Execution Time
Cannot Compute + Time-out 111 11 37 Times tool wins 51 170


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