Introduction
This page presents how LTSMin 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 LTSMin' 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).
LTSMin versus Cunf
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to Cunf are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | Cunf | Both tools | LTSMin | Cunf | ||
| Computed OK | 58 | 0 | 9 | Smallest Memory Footprint | ||
| Do not compete | 0 | 98 | 0 | Times tool wins | 58 | 9 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 49 | 9 | 5 | Times tool wins | 60 | 7 |
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.
LTSMin versus GreatSPN-Meddly
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to GreatSPN-Meddly are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | GreatSPN-Meddly | Both tools | LTSMin | GreatSPN-Meddly | ||
| Computed OK | 28 | 1 | 39 | Smallest Memory Footprint | ||
| Do not compete | 0 | 0 | 0 | Times tool wins | 41 | 27 |
| Error detected | 0 | 2 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 2 | 27 | 52 | Times tool wins | 54 | 14 |
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.
LTSMin versus LoLA2.0
Some statistics are displayed below, based on 242 runs (121 for LTSMin and 121 for LoLA2.0, 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 LTSMin to LoLA2.0 are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | LoLA2.0 | Both tools | LTSMin | LoLA2.0 | ||
| Computed OK | 1 | 24 | 66 | Smallest Memory Footprint | ||
| Do not compete | 0 | 27 | 0 | Times tool wins | 9 | 82 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 51 | 1 | 3 | Times tool wins | 26 | 65 |
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.
LTSMin versus Marcie
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to Marcie are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | Marcie | Both tools | LTSMin | Marcie | ||
| Computed OK | 16 | 13 | 51 | Smallest Memory Footprint | ||
| Do not compete | 0 | 0 | 0 | Times tool wins | 45 | 35 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 13 | 16 | 41 | Times tool wins | 51 | 29 |
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.
LTSMin versus TAPAAL(MC)
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to TAPAAL(MC) are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | TAPAAL(MC) | Both tools | LTSMin | TAPAAL(MC) | ||
| Computed OK | 8 | 15 | 59 | Smallest Memory Footprint | ||
| Do not compete | 0 | 27 | 0 | Times tool wins | 16 | 66 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 42 | 8 | 12 | Times tool wins | 8 | 74 |
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.
_ReachabilityDeadlock.png)
_ReachabilityDeadlock.png)
LTSMin versus TAPAAL(SEQ)
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to TAPAAL(SEQ) are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | TAPAAL(SEQ) | Both tools | LTSMin | TAPAAL(SEQ) | ||
| Computed OK | 0 | 27 | 67 | Smallest Memory Footprint | ||
| Do not compete | 0 | 27 | 0 | Times tool wins | 1 | 93 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 54 | 0 | 0 | Times tool wins | 8 | 86 |
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.
_ReachabilityDeadlock.png)
_ReachabilityDeadlock.png)
LTSMin versus TAPAAL-OTF(PAR)
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to TAPAAL-OTF(PAR) are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | TAPAAL-OTF(PAR) | Both tools | LTSMin | TAPAAL-OTF(PAR) | ||
| Computed OK | 19 | 13 | 48 | Smallest Memory Footprint | ||
| Do not compete | 0 | 27 | 0 | Times tool wins | 22 | 58 |
| Error detected | 0 | 0 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 40 | 19 | 14 | Times tool wins | 24 | 56 |
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.
_ReachabilityDeadlock.png)
_ReachabilityDeadlock.png)
LTSMin versus TAPAAL-OTF(SEQ)
Some statistics are displayed below, based on 242 runs (121 for LTSMin 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 LTSMin to TAPAAL-OTF(SEQ) are shown (you may click on one graph to enlarge it).
| Statistics on the execution | ||||||
| LTSMin | TAPAAL-OTF(SEQ) | Both tools | LTSMin | TAPAAL-OTF(SEQ) | ||
| Computed OK | 0 | 17 | 67 | Smallest Memory Footprint | ||
| Do not compete | 0 | 27 | 0 | Times tool wins | 14 | 70 |
| Error detected | 0 | 3 | 0 | Shortest Execution Time | ||
| Cannot Compute + Time-out | 47 | 0 | 7 | Times tool wins | 14 | 70 |
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.
_ReachabilityDeadlock.png)
_ReachabilityDeadlock.png)