fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
LoLA2.0 compared to other tools («Stripped» models, ReachabilityBounds)
Last Updated
August 19, 2015

Introduction

This page presents how LoLA2.0 do cope efficiently with the ReachabilityBounds examination face to the other participating tools. In this page, we consider «Stripped» 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 LoLA2.0' 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).

LoLA2.0 versus GreatSPN-Meddly

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

Statistics on the execution
  LoLA2.0 GreatSPN-Meddly Both tools   LoLA2.0 GreatSPN-Meddly
Computed OK 162 1 95   Smallest Memory Footprint
Do not compete 23 0 114 Times tool wins 236 22
Error detected 1 51 2   Shortest Execution Time
Cannot Compute + Time-out 0 134 7 Times tool wins 222 36


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

LoLA2.0 versus LTSMin

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

Statistics on the execution
  LoLA2.0 LTSMin Both tools   LoLA2.0 LTSMin
Computed OK 257 0 0   Smallest Memory Footprint
Do not compete 137 266 0 Times tool wins 257 0
Error detected 3 0 0   Shortest Execution Time
Cannot Compute + Time-out 6 137 1 Times tool wins 257 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

LoLA2.0 versus Marcie

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

Statistics on the execution
  LoLA2.0 Marcie Both tools   LoLA2.0 Marcie
Computed OK 135 40 122   Smallest Memory Footprint
Do not compete 137 0 0 Times tool wins 243 54
Error detected 3 12 0   Shortest Execution Time
Cannot Compute + Time-out 1 224 6 Times tool wins 216 81


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

LoLA2.0 versus TAPAAL(MC)

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

Statistics on the execution
  LoLA2.0 TAPAAL(MC) Both tools   LoLA2.0 TAPAAL(MC)
Computed OK 104 6 153   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 205 58
Error detected 3 0 0   Shortest Execution Time
Cannot Compute + Time-out 3 104 4 Times tool wins 152 111


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

LoLA2.0 versus TAPAAL(SEQ)

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

Statistics on the execution
  LoLA2.0 TAPAAL(SEQ) Both tools   LoLA2.0 TAPAAL(SEQ)
Computed OK 0 5 257   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 128 134
Error detected 3 0 0   Shortest Execution Time
Cannot Compute + Time-out 2 0 5 Times tool wins 153 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

LoLA2.0 versus TAPAAL-OTF(PAR)

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

Statistics on the execution
  LoLA2.0 TAPAAL-OTF(PAR) Both tools   LoLA2.0 TAPAAL-OTF(PAR)
Computed OK 180 0 77   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 236 21
Error detected 3 11 0   Shortest Execution Time
Cannot Compute + Time-out 0 172 7 Times tool wins 226 31


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

LoLA2.0 versus TAPAAL-OTF(SEQ)

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

Statistics on the execution
  LoLA2.0 TAPAAL-OTF(SEQ) Both tools   LoLA2.0 TAPAAL-OTF(SEQ)
Computed OK 180 0 77   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 238 19
Error detected 3 11 0   Shortest Execution Time
Cannot Compute + Time-out 0 172 7 Times tool wins 225 32


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