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

Introduction

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

Marcie versus Cunf

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

Statistics on the execution
  Marcie Cunf Both tools   Marcie Cunf
Computed OK 277 26 129   Smallest Memory Footprint
Do not compete 0 652 0 Times tool wins 278 154
Error detected 0 4 0   Shortest Execution Time
Cannot Compute + Time-out 440 35 83 Times tool wins 283 149


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

Marcie versus GreatSPN-Meddly

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

Statistics on the execution
  Marcie GreatSPN-Meddly Both tools   Marcie GreatSPN-Meddly
Computed OK 176 93 230   Smallest Memory Footprint
Do not compete 0 228 0 Times tool wins 178 321
Error detected 0 2 0   Shortest Execution Time
Cannot Compute + Time-out 267 120 256 Times tool wins 256 243


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

Marcie versus LoLA2.0

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

Statistics on the execution
  Marcie LoLA2.0 Both tools   Marcie LoLA2.0
Computed OK 91 248 315   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 144 510
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 471 13 52 Times tool wins 154 500


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

Marcie versus LTSMin

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

Statistics on the execution
  Marcie LTSMin Both tools   Marcie LTSMin
Computed OK 144 96 262   Smallest Memory Footprint
Do not compete 0 0 0 Times tool wins 280 222
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 96 144 427 Times tool wins 255 247


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

Marcie versus TAPAAL(MC)

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

Statistics on the execution
  Marcie TAPAAL(MC) Both tools   Marcie TAPAAL(MC)
Computed OK 184 166 222   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 184 388
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 389 106 134 Times tool wins 207 365


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

Marcie versus TAPAAL(SEQ)

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

Statistics on the execution
  Marcie TAPAAL(SEQ) Both tools   Marcie TAPAAL(SEQ)
Computed OK 80 296 326   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 141 561
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 519 2 4 Times tool wins 201 501


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

Marcie versus TAPAAL-OTF(PAR)

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

Statistics on the execution
  Marcie TAPAAL-OTF(PAR) Both tools   Marcie TAPAAL-OTF(PAR)
Computed OK 196 73 210   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 235 244
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 296 118 227 Times tool wins 274 205


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

Marcie versus TAPAAL-OTF(SEQ)

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

Statistics on the execution
  Marcie TAPAAL-OTF(SEQ) Both tools   Marcie TAPAAL-OTF(SEQ)
Computed OK 106 202 300   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 106 502
Error detected 0 23 0   Shortest Execution Time
Cannot Compute + Time-out 436 16 87 Times tool wins 234 374


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