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

Introduction

This page presents how TAPAAL(MC) 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 TAPAAL(MC)' 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).

TAPAAL(MC) versus Cunf

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

Statistics on the execution
  TAPAAL(MC) Cunf Both tools   TAPAAL(MC) Cunf
Computed OK 98 14 59   Smallest Memory Footprint
Do not compete 0 140 137 Times tool wins 106 65
Error detected 0 2 0   Shortest Execution Time
Cannot Compute + Time-out 78 20 32 Times tool wins 104 67


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

TAPAAL(MC) versus GreatSPN-Meddly

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

Statistics on the execution
  TAPAAL(MC) GreatSPN-Meddly Both tools   TAPAAL(MC) GreatSPN-Meddly
Computed OK 46 31 111   Smallest Memory Footprint
Do not compete 23 0 114 Times tool wins 138 50
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 31 69 79 Times tool wins 139 49


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

TAPAAL(MC) versus LoLA2.0

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

Statistics on the execution
  TAPAAL(MC) LoLA2.0 Both tools   TAPAAL(MC) LoLA2.0
Computed OK 6 86 151   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 27 216
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 86 6 24 Times tool wins 28 215


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

TAPAAL(MC) versus LTSMin

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

Statistics on the execution
  TAPAAL(MC) LTSMin Both tools   TAPAAL(MC) LTSMin
Computed OK 46 34 111   Smallest Memory Footprint
Do not compete 137 0 0 Times tool wins 153 38
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 34 183 76 Times tool wins 142 49


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

TAPAAL(MC) versus Marcie

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

Statistics on the execution
  TAPAAL(MC) Marcie Both tools   TAPAAL(MC) Marcie
Computed OK 69 84 88   Smallest Memory Footprint
Do not compete 137 0 0 Times tool wins 157 84
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 49 171 61 Times tool wins 145 96


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

TAPAAL(MC) versus TAPAAL(SEQ)

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

Statistics on the execution
  TAPAAL(MC) TAPAAL(SEQ) Both tools   TAPAAL(MC) TAPAAL(SEQ)
Computed OK 0 107 157   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 14 250
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 107 0 3 Times tool wins 44 220


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

TAPAAL(MC) versus TAPAAL-OTF(PAR)

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

Statistics on the execution
  TAPAAL(MC) TAPAAL-OTF(PAR) Both tools   TAPAAL(MC) TAPAAL-OTF(PAR)
Computed OK 68 22 89   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 117 62
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 22 68 88 Times tool wins 146 33


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

TAPAAL(MC) versus TAPAAL-OTF(SEQ)

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

Statistics on the execution
  TAPAAL(MC) TAPAAL-OTF(SEQ) Both tools   TAPAAL(MC) TAPAAL-OTF(SEQ)
Computed OK 7 59 150   Smallest Memory Footprint
Do not compete 0 0 137 Times tool wins 126 90
Error detected 0 10 0   Shortest Execution Time
Cannot Compute + Time-out 66 4 44 Times tool wins 127 89


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