Introduction
This page presents how tedd 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 tedd' 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).
tedd versus GreatSPN+red
Some statistics are displayed below, based on 208 runs (104 for tedd 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 tedd to GreatSPN+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd | GreatSPN+red | Both tools | tedd | GreatSPN+red | ||
| All computed OK | 0 | 2 | 77 | Smallest Memory Footprint | ||
| tedd = GreatSPN+red | — | — | 0 | Times tool wins | 0 | 79 |
| tedd > GreatSPN+red | — | — | 0 | Shortest Execution Time | ||
| tedd < GreatSPN+red | — | — | 0 | Times tool wins | 20 | 59 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 2 | 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 tedd
computed more values than GreatSPN+red,
denote cases where tedd
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.
tedd wins when points are below the diagonal, GreatSPN+red wins when points are above the diagonal.
tedd versus ITS-Tools
Some statistics are displayed below, based on 208 runs (104 for tedd 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 tedd to ITS-Tools are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd | ITS-Tools | Both tools | tedd | ITS-Tools | ||
| All computed OK | 10 | 1 | 0 | Smallest Memory Footprint | ||
| tedd = ITS-Tools | — | — | 0 | Times tool wins | 19 | 59 |
| tedd > ITS-Tools | — | — | 67 | Shortest Execution Time | ||
| tedd < ITS-Tools | — | — | 0 | Times tool wins | 73 | 5 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 1 | 10 | 26 | |||
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 tedd
computed more values than ITS-Tools,
denote cases where tedd
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.
tedd wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.
tedd versus NoHD
Some statistics are displayed below, based on 208 runs (104 for tedd and 104 for NoHD, 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 tedd to NoHD are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd | NoHD | Both tools | tedd | NoHD | ||
| All computed OK | 67 | 0 | 10 | Smallest Memory Footprint | ||
| tedd = NoHD | — | — | 0 | Times tool wins | 77 | 0 |
| tedd > NoHD | — | — | 0 | Shortest Execution Time | ||
| tedd < NoHD | — | — | 0 | Times tool wins | 77 | 0 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 67 | 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 tedd
computed more values than NoHD,
denote cases where tedd
computed less values than NoHD,
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.
tedd wins when points are below the diagonal, NoHD wins when points are above the diagonal.
tedd versus 2023-gold
Some statistics are displayed below, based on 208 runs (104 for tedd 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 tedd to 2023-gold are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd | 2023-gold | Both tools | tedd | 2023-gold | ||
| All computed OK | 0 | 0 | 77 | Smallest Memory Footprint | ||
| tedd = 2023-gold | — | — | 0 | Times tool wins | 18 | 59 |
| tedd > 2023-gold | — | — | 0 | Shortest Execution Time | ||
| tedd < 2023-gold | — | — | 0 | Times tool wins | 38 | 39 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 0 | 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 tedd
computed more values than 2023-gold,
denote cases where tedd
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.
tedd wins when points are below the diagonal, 2023-gold wins when points are above the diagonal.
tedd versus BVT-2024
Some statistics are displayed below, based on 208 runs (104 for tedd 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 tedd to BVT-2024 are shown (you may click on one graph to enlarge it).
Important: here, tedd is compared to BVT-2024. It is a good way to check how tedd compete in terms of resource consomption with the best tools (even virtual). When tedd is best, the corresponding plots are on the diagonal of the scatter plots chart.
| Statistics on the executions | ||||||
| tedd | BVT-2024 | Both tools | tedd | BVT-2024 | ||
| All computed OK | 0 | 1 | 77 | Smallest Memory Footprint | ||
| tedd = BVT-2024 | — | — | 0 | Times tool wins | 0 | 78 |
| tedd > BVT-2024 | — | — | 0 | Shortest Execution Time | ||
| tedd < BVT-2024 | — | — | 0 | Times tool wins | 0 | 78 |
| Do not compete | 0 | 26 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 27 | 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 tedd
computed more values than BVT-2024,
denote cases where tedd
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.
tedd wins when points are below the diagonal, BVT-2024 wins when points are above the diagonal.
tedd versus GreatSPN
Some statistics are displayed below, based on 208 runs (104 for tedd 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 tedd to GreatSPN are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd | GreatSPN | Both tools | tedd | GreatSPN | ||
| All computed OK | 0 | 5 | 77 | Smallest Memory Footprint | ||
| tedd = GreatSPN | — | — | 0 | Times tool wins | 0 | 82 |
| tedd > GreatSPN | — | — | 0 | Shortest Execution Time | ||
| tedd < GreatSPN | — | — | 0 | Times tool wins | 13 | 69 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 5 | 0 | 22 | |||
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 tedd
computed more values than GreatSPN,
denote cases where tedd
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.
tedd wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.
