Introduction
This page presents how LTSMin do cope efficiently with the StateSpace examination face to the other participating tools. In this page, we consider «Surprise» models.
The next sections will show chart comparing performances in terms of 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 while others 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 GreatSPN
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for GreatSPN, so there are 61 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 are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | GreatSPN | Both tools | LTSMin | GreatSPN | ||
| All computed OK | 2 | 19 | 0 | Smallest Memory Footprint | ||
| LTSMin = GreatSPN | — | — | 0 | Times tool wins | 4 | 41 |
| LTSMin > GreatSPN | — | — | 0 | Shortest Execution Time | ||
| LTSMin < GreatSPN | — | — | 24 | Times tool wins | 4 | 41 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 19 | 2 | 16 | |||
On the chart below, 
denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than GreatSPN,
denote cases where LTSMin
computed less values than GreatSPN,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and 
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.
LTSMin versus ITS-Tools
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for ITS-Tools, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to ITS-Tools are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | ITS-Tools | Both tools | LTSMin | ITS-Tools | ||
| All computed OK | 0 | 17 | 0 | Smallest Memory Footprint | ||
| LTSMin = ITS-Tools | — | — | 26 | Times tool wins | 19 | 24 |
| LTSMin > ITS-Tools | — | — | 0 | Shortest Execution Time | ||
| LTSMin < ITS-Tools | — | — | 0 | Times tool wins | 22 | 21 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 17 | 0 | 18 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than ITS-Tools,
denote cases where LTSMin
computed less values than ITS-Tools,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.
LTSMin versus tedd-c
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for tedd-c, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to tedd-c are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | tedd-c | Both tools | LTSMin | tedd-c | ||
| All computed OK | 0 | 23 | 0 | Smallest Memory Footprint | ||
| LTSMin = tedd-c | — | — | 0 | Times tool wins | 13 | 36 |
| LTSMin > tedd-c | — | — | 0 | Shortest Execution Time | ||
| LTSMin < tedd-c | — | — | 26 | Times tool wins | 17 | 32 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 23 | 0 | 12 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than tedd-c,
denote cases where LTSMin
computed less values than tedd-c,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, tedd-c wins when points are above the diagonal.
LTSMin versus LoLa+red
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for LoLa+red, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to LoLa+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | LoLa+red | Both tools | LTSMin | LoLa+red | ||
| All computed OK | 26 | 0 | 0 | Smallest Memory Footprint | ||
| LTSMin = LoLa+red | — | — | 0 | Times tool wins | 26 | 0 |
| LTSMin > LoLa+red | — | — | 0 | Shortest Execution Time | ||
| LTSMin < LoLa+red | — | — | 0 | Times tool wins | 26 | 0 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 26 | 35 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than LoLa+red,
denote cases where LTSMin
computed less values than LoLa+red,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, LoLa+red wins when points are above the diagonal.
LTSMin versus LTSMin+red
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for LTSMin+red, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to LTSMin+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | LTSMin+red | Both tools | LTSMin | LTSMin+red | ||
| All computed OK | 0 | 0 | 0 | Smallest Memory Footprint | ||
| LTSMin = LTSMin+red | — | — | 26 | Times tool wins | 16 | 10 |
| LTSMin > LTSMin+red | — | — | 0 | Shortest Execution Time | ||
| LTSMin < LTSMin+red | — | — | 0 | Times tool wins | 23 | 3 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 0 | 35 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than LTSMin+red,
denote cases where LTSMin
computed less values than LTSMin+red,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, LTSMin+red wins when points are above the diagonal.
LTSMin versus Marcie+red
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for Marcie+red, so there are 61 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+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | Marcie+red | Both tools | LTSMin | Marcie+red | ||
| All computed OK | 0 | 16 | 0 | Smallest Memory Footprint | ||
| LTSMin = Marcie+red | — | — | 0 | Times tool wins | 18 | 24 |
| LTSMin > Marcie+red | — | — | 0 | Shortest Execution Time | ||
| LTSMin < Marcie+red | — | — | 26 | Times tool wins | 12 | 30 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 16 | 0 | 19 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than Marcie+red,
denote cases where LTSMin
computed less values than Marcie+red,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, Marcie+red wins when points are above the diagonal.
LTSMin versus Smart+red
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for Smart+red, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to Smart+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | Smart+red | Both tools | LTSMin | Smart+red | ||
| All computed OK | 1 | 16 | 0 | Smallest Memory Footprint | ||
| LTSMin = Smart+red | — | — | 0 | Times tool wins | 11 | 31 |
| LTSMin > Smart+red | — | — | 0 | Shortest Execution Time | ||
| LTSMin < Smart+red | — | — | 25 | Times tool wins | 12 | 30 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 16 | 1 | 19 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than Smart+red,
denote cases where LTSMin
computed less values than Smart+red,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, Smart+red wins when points are above the diagonal.
LTSMin versus 2022-gold
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for 2022-gold, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to 2022-gold are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | 2022-gold | Both tools | LTSMin | 2022-gold | ||
| All computed OK | 0 | 23 | 0 | Smallest Memory Footprint | ||
| LTSMin = 2022-gold | — | — | 0 | Times tool wins | 14 | 35 |
| LTSMin > 2022-gold | — | — | 0 | Shortest Execution Time | ||
| LTSMin < 2022-gold | — | — | 26 | Times tool wins | 17 | 32 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 23 | 0 | 12 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than 2022-gold,
denote cases where LTSMin
computed less values than 2022-gold,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, 2022-gold wins when points are above the diagonal.
LTSMin versus BVT-2023
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for BVT-2023, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to BVT-2023 are shown (you may click on one graph to enlarge it).
Important: here, LTSMin is compared to BVT-2023. It is a good way to check how LTSMin compete in terms of resource consomption with the best tools (even virtual). When LTSMin is best, the corresponding plots are on the diagonal of the scatter plots chart.
| Statistics on the executions | ||||||
| LTSMin | BVT-2023 | Both tools | LTSMin | BVT-2023 | ||
| All computed OK | 0 | 26 | 0 | Smallest Memory Footprint | ||
| LTSMin = BVT-2023 | — | — | 0 | Times tool wins | 0 | 52 |
| LTSMin > BVT-2023 | — | — | 0 | Shortest Execution Time | ||
| LTSMin < BVT-2023 | — | — | 26 | Times tool wins | 0 | 52 |
| Do not compete | 0 | 9 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 35 | 0 | 0 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than BVT-2023,
denote cases where LTSMin
computed less values than BVT-2023,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, BVT-2023 wins when points are above the diagonal.
LTSMin versus Marcie
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for Marcie, so there are 61 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 executions | ||||||
| LTSMin | Marcie | Both tools | LTSMin | Marcie | ||
| All computed OK | 0 | 16 | 0 | Smallest Memory Footprint | ||
| LTSMin = Marcie | — | — | 0 | Times tool wins | 18 | 24 |
| LTSMin > Marcie | — | — | 0 | Shortest Execution Time | ||
| LTSMin < Marcie | — | — | 26 | Times tool wins | 12 | 30 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 16 | 0 | 19 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than Marcie,
denote cases where LTSMin
computed less values than Marcie,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, Marcie wins when points are above the diagonal.
LTSMin versus pnmc
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for pnmc, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to pnmc are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | pnmc | Both tools | LTSMin | pnmc | ||
| All computed OK | 0 | 10 | 0 | Smallest Memory Footprint | ||
| LTSMin = pnmc | — | — | 26 | Times tool wins | 18 | 18 |
| LTSMin > pnmc | — | — | 0 | Shortest Execution Time | ||
| LTSMin < pnmc | — | — | 0 | Times tool wins | 12 | 24 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 10 | 0 | 25 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than pnmc,
denote cases where LTSMin
computed less values than pnmc,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, pnmc wins when points are above the diagonal.
LTSMin versus Smart
Some statistics are displayed below, based on 122 runs (61 for LTSMin and 61 for Smart, so there are 61 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin to Smart are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin | Smart | Both tools | LTSMin | Smart | ||
| All computed OK | 6 | 8 | 0 | Smallest Memory Footprint | ||
| LTSMin = Smart | — | — | 0 | Times tool wins | 10 | 24 |
| LTSMin > Smart | — | — | 0 | Shortest Execution Time | ||
| LTSMin < Smart | — | — | 20 | Times tool wins | 15 | 19 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 8 | 6 | 27 | |||
On the chart below, denote cases where
the two tools did computed all results without error,
denote cases where the two tool did computed the
same number of values (but not al values in the examination),
denote cases where LTSMin
computed more values than Smart,
denote cases where LTSMin
computed less values than Smart,
denote the cases where at least one tool did not competed,
denote the cases where at least one
tool computed a bad value and
denote the cases where at least one tool stated it could not compute a result or timed-out.
LTSMin wins when points are below the diagonal, Smart wins when points are above the diagonal.
