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

Introduction

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

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

Statistics on the execution
  LoLA2.0 Cunf Both tools   LoLA2.0 Cunf
Computed OK 81 0 9   Smallest Memory Footprint
Do not compete 0 71 27 Times tool wins 84 6
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 0 10 4 Times tool wins 84 6


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 GreatSPN-Meddly

Some statistics are displayed below, based on 242 runs (121 for LoLA2.0 and 121 for GreatSPN-Meddly, so there are 121 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 50 0 40   Smallest Memory Footprint
Do not compete 27 0 0 Times tool wins 85 5
Error detected 0 2 0   Shortest Execution Time
Cannot Compute + Time-out 0 75 4 Times tool wins 86 4


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 242 runs (121 for LoLA2.0 and 121 for LTSMin, so there are 121 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 24 1 66   Smallest Memory Footprint
Do not compete 27 0 0 Times tool wins 82 9
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 1 51 3 Times tool wins 65 26


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 242 runs (121 for LoLA2.0 and 121 for Marcie, so there are 121 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 34 8 56   Smallest Memory Footprint
Do not compete 27 0 0 Times tool wins 85 13
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 0 53 4 Times tool wins 85 13


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 242 runs (121 for LoLA2.0 and 121 for TAPAAL(MC), so there are 121 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 16 0 74   Smallest Memory Footprint
Do not compete 0 0 27 Times tool wins 63 27
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 0 16 4 Times tool wins 28 62


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 242 runs (121 for LoLA2.0 and 121 for TAPAAL(SEQ), so there are 121 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 4 90   Smallest Memory Footprint
Do not compete 0 0 27 Times tool wins 31 63
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 4 0 0 Times tool wins 26 68


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 242 runs (121 for LoLA2.0 and 121 for TAPAAL-OTF(PAR), so there are 121 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 29 0 61   Smallest Memory Footprint
Do not compete 0 0 27 Times tool wins 77 13
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 0 29 4 Times tool wins 63 27


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 242 runs (121 for LoLA2.0 and 121 for TAPAAL-OTF(SEQ), so there are 121 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 7 1 83   Smallest Memory Footprint
Do not compete 0 0 27 Times tool wins 78 13
Error detected 0 3 0   Shortest Execution Time
Cannot Compute + Time-out 1 4 3 Times tool wins 53 38


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