Introduction
This page presents how LTSMin+red do cope efficiently with the ReachabilityCardinality 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+red' 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+red versus GreatSPN+red
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for GreatSPN+red, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to GreatSPN+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | GreatSPN+red | Both tools | LTSMin+red | GreatSPN+red | ||
| All computed OK | 0 | 0 | 58 | Smallest Memory Footprint | ||
| LTSMin+red = GreatSPN+red | — | — | 15 | Times tool wins | 50 | 54 |
| LTSMin+red > GreatSPN+red | — | — | 7 | Shortest Execution Time | ||
| LTSMin+red < GreatSPN+red | — | — | 24 | Times tool wins | 68 | 36 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than GreatSPN+red,
denote cases where LTSMin+red
computed less values than GreatSPN+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+red wins when points are below the diagonal, GreatSPN+red wins when points are above the diagonal.
LTSMin+red versus ITS-Tools
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for ITS-Tools, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to ITS-Tools are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | ITS-Tools | Both tools | LTSMin+red | ITS-Tools | ||
| All computed OK | 0 | 0 | 57 | Smallest Memory Footprint | ||
| LTSMin+red = ITS-Tools | — | — | 16 | Times tool wins | 52 | 52 |
| LTSMin+red > ITS-Tools | — | — | 12 | Shortest Execution Time | ||
| LTSMin+red < ITS-Tools | — | — | 19 | Times tool wins | 36 | 68 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than ITS-Tools,
denote cases where LTSMin+red
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+red wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.
LTSMin+red versus LoLA
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for LoLA, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to LoLA are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | LoLA | Both tools | LTSMin+red | LoLA | ||
| All computed OK | 20 | 0 | 45 | Smallest Memory Footprint | ||
| LTSMin+red = LoLA | — | — | 3 | Times tool wins | 86 | 18 |
| LTSMin+red > LoLA | — | — | 26 | Shortest Execution Time | ||
| LTSMin+red < LoLA | — | — | 10 | Times tool wins | 95 | 9 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 20 | 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+red
computed more values than LoLA,
denote cases where LTSMin+red
computed less values than LoLA,
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+red wins when points are below the diagonal, LoLA wins when points are above the diagonal.
LTSMin+red versus smpt
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for smpt, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to smpt are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | smpt | Both tools | LTSMin+red | smpt | ||
| All computed OK | 0 | 0 | 50 | Smallest Memory Footprint | ||
| LTSMin+red = smpt | — | — | 10 | Times tool wins | 53 | 51 |
| LTSMin+red > smpt | — | — | 18 | Shortest Execution Time | ||
| LTSMin+red < smpt | — | — | 26 | Times tool wins | 86 | 18 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than smpt,
denote cases where LTSMin+red
computed less values than smpt,
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+red wins when points are below the diagonal, smpt wins when points are above the diagonal.
LTSMin+red versus Tapaal
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for Tapaal, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to Tapaal are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | Tapaal | Both tools | LTSMin+red | Tapaal | ||
| All computed OK | 0 | 0 | 58 | Smallest Memory Footprint | ||
| LTSMin+red = Tapaal | — | — | 3 | Times tool wins | 10 | 94 |
| LTSMin+red > Tapaal | — | — | 4 | Shortest Execution Time | ||
| LTSMin+red < Tapaal | — | — | 39 | Times tool wins | 47 | 57 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than Tapaal,
denote cases where LTSMin+red
computed less values than Tapaal,
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+red wins when points are below the diagonal, Tapaal wins when points are above the diagonal.
LTSMin+red versus 2023-gold
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for 2023-gold, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to 2023-gold are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | 2023-gold | Both tools | LTSMin+red | 2023-gold | ||
| All computed OK | 0 | 0 | 59 | Smallest Memory Footprint | ||
| LTSMin+red = 2023-gold | — | — | 11 | Times tool wins | 46 | 58 |
| LTSMin+red > 2023-gold | — | — | 7 | Shortest Execution Time | ||
| LTSMin+red < 2023-gold | — | — | 27 | Times tool wins | 87 | 17 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than 2023-gold,
denote cases where LTSMin+red
computed less values than 2023-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+red wins when points are below the diagonal, 2023-gold wins when points are above the diagonal.
LTSMin+red versus BVT-2024
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for BVT-2024, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to BVT-2024 are shown (you may click on one graph to enlarge it).
Important: here, LTSMin+red is compared to BVT-2024. It is a good way to check how LTSMin+red compete in terms of resource consomption with the best tools (even virtual). When LTSMin+red is best, the corresponding plots are on the diagonal of the scatter plots chart.
| Statistics on the executions | ||||||
| LTSMin+red | BVT-2024 | Both tools | LTSMin+red | BVT-2024 | ||
| All computed OK | 0 | 0 | 59 | Smallest Memory Footprint | ||
| LTSMin+red = BVT-2024 | — | — | 2 | Times tool wins | 0 | 104 |
| LTSMin+red > BVT-2024 | — | — | 0 | Shortest Execution Time | ||
| LTSMin+red < BVT-2024 | — | — | 43 | Times tool wins | 0 | 104 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 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+red
computed more values than BVT-2024,
denote cases where LTSMin+red
computed less values than BVT-2024,
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+red wins when points are below the diagonal, BVT-2024 wins when points are above the diagonal.
LTSMin+red versus GreatSPN
Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for GreatSPN, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to GreatSPN are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| LTSMin+red | GreatSPN | Both tools | LTSMin+red | GreatSPN | ||
| All computed OK | 25 | 0 | 42 | Smallest Memory Footprint | ||
| LTSMin+red = GreatSPN | — | — | 0 | Times tool wins | 77 | 27 |
| LTSMin+red > GreatSPN | — | — | 19 | Shortest Execution Time | ||
| LTSMin+red < GreatSPN | — | — | 18 | Times tool wins | 84 | 20 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 25 | 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+red
computed more values than GreatSPN,
denote cases where LTSMin+red
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+red wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.
