Introduction
This page presents how tedd-c do cope efficiently with the StateSpace examination face to the other participating tools. In this page, we consider «Known» 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-c' 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-c versus GreatSPN
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for GreatSPN, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to GreatSPN are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | GreatSPN | Both tools | tedd-c | GreatSPN | ||
| All computed OK | 182 | 30 | 917 | Smallest Memory Footprint | ||
| tedd-c = GreatSPN | — | — | 0 | Times tool wins | 326 | 818 |
| tedd-c > GreatSPN | — | — | 14 | Shortest Execution Time | ||
| tedd-c < GreatSPN | — | — | 1 | Times tool wins | 531 | 613 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 3 | 0 | |||
| Cannot Compute + Time-out | 30 | 179 | 473 | |||
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-c
computed more values than GreatSPN,
denote cases where tedd-c
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-c wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.
tedd-c versus ITS-Tools
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for ITS-Tools, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to ITS-Tools are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | ITS-Tools | Both tools | tedd-c | ITS-Tools | ||
| All computed OK | 207 | 32 | 0 | Smallest Memory Footprint | ||
| tedd-c = ITS-Tools | — | — | 1 | Times tool wins | 416 | 730 |
| tedd-c > ITS-Tools | — | — | 906 | Shortest Execution Time | ||
| tedd-c < ITS-Tools | — | — | 0 | Times tool wins | 928 | 218 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 3 | 0 | |||
| Cannot Compute + Time-out | 33 | 205 | 470 | |||
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-c
computed more values than ITS-Tools,
denote cases where tedd-c
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-c wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.
tedd-c versus LoLa+red
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for LoLa+red, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to LoLa+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | LoLa+red | Both tools | tedd-c | LoLa+red | ||
| All computed OK | 1114 | 0 | 0 | Smallest Memory Footprint | ||
| tedd-c = LoLa+red | — | — | 0 | Times tool wins | 1114 | 0 |
| tedd-c > LoLa+red | — | — | 0 | Shortest Execution Time | ||
| tedd-c < LoLa+red | — | — | 0 | Times tool wins | 1114 | 0 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 0 | 1114 | 503 | |||
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-c
computed more values than LoLa+red,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, LoLa+red wins when points are above the diagonal.
tedd-c versus LTSMin+red
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for LTSMin+red, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to LTSMin+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | LTSMin+red | Both tools | tedd-c | LTSMin+red | ||
| All computed OK | 460 | 20 | 0 | Smallest Memory Footprint | ||
| tedd-c = LTSMin+red | — | — | 0 | Times tool wins | 602 | 532 |
| tedd-c > LTSMin+red | — | — | 654 | Shortest Execution Time | ||
| tedd-c < LTSMin+red | — | — | 0 | Times tool wins | 1005 | 129 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 20 | 460 | 483 | |||
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-c
computed more values than LTSMin+red,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, LTSMin+red wins when points are above the diagonal.
tedd-c versus Marcie+red
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for Marcie+red, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to Marcie+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | Marcie+red | Both tools | tedd-c | Marcie+red | ||
| All computed OK | 442 | 6 | 663 | Smallest Memory Footprint | ||
| tedd-c = Marcie+red | — | — | 0 | Times tool wins | 1028 | 92 |
| tedd-c > Marcie+red | — | — | 9 | Shortest Execution Time | ||
| tedd-c < Marcie+red | — | — | 0 | Times tool wins | 1043 | 77 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 6 | 442 | 497 | |||
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-c
computed more values than Marcie+red,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, Marcie+red wins when points are above the diagonal.
tedd-c versus Smart+red
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for Smart+red, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to Smart+red are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | Smart+red | Both tools | tedd-c | Smart+red | ||
| All computed OK | 514 | 16 | 596 | Smallest Memory Footprint | ||
| tedd-c = Smart+red | — | — | 0 | Times tool wins | 658 | 472 |
| tedd-c > Smart+red | — | — | 4 | Shortest Execution Time | ||
| tedd-c < Smart+red | — | — | 0 | Times tool wins | 1057 | 73 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 3 | 0 | |||
| Cannot Compute + Time-out | 17 | 512 | 486 | |||
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-c
computed more values than Smart+red,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, Smart+red wins when points are above the diagonal.
tedd-c versus 2022-gold
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for 2022-gold, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to 2022-gold are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | 2022-gold | Both tools | tedd-c | 2022-gold | ||
| All computed OK | 11 | 4 | 1099 | Smallest Memory Footprint | ||
| tedd-c = 2022-gold | — | — | 2 | Times tool wins | 606 | 512 |
| tedd-c > 2022-gold | — | — | 1 | Shortest Execution Time | ||
| tedd-c < 2022-gold | — | — | 1 | Times tool wins | 841 | 277 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 4 | 11 | 499 | |||
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-c
computed more values than 2022-gold,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, 2022-gold wins when points are above the diagonal.
tedd-c versus BVT-2023
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for BVT-2023, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to BVT-2023 are shown (you may click on one graph to enlarge it).
Important: here, tedd-c is compared to BVT-2023. It is a good way to check how tedd-c compete in terms of resource consomption with the best tools (even virtual). When tedd-c is best, the corresponding plots are on the diagonal of the scatter plots chart.
| Statistics on the executions | ||||||
| tedd-c | BVT-2023 | Both tools | tedd-c | BVT-2023 | ||
| All computed OK | 0 | 75 | 1111 | Smallest Memory Footprint | ||
| tedd-c = BVT-2023 | — | — | 0 | Times tool wins | 0 | 1188 |
| tedd-c > BVT-2023 | — | — | 0 | Shortest Execution Time | ||
| tedd-c < BVT-2023 | — | — | 2 | Times tool wins | 0 | 1188 |
| Do not compete | 0 | 427 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 502 | 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-c
computed more values than BVT-2023,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, BVT-2023 wins when points are above the diagonal.
tedd-c versus LTSMin
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for LTSMin, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to LTSMin are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | LTSMin | Both tools | tedd-c | LTSMin | ||
| All computed OK | 413 | 20 | 0 | Smallest Memory Footprint | ||
| tedd-c = LTSMin | — | — | 0 | Times tool wins | 541 | 593 |
| tedd-c > LTSMin | — | — | 701 | Shortest Execution Time | ||
| tedd-c < LTSMin | — | — | 0 | Times tool wins | 714 | 420 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 20 | 413 | 483 | |||
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-c
computed more values than LTSMin,
denote cases where tedd-c
computed less values than LTSMin,
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-c wins when points are below the diagonal, LTSMin wins when points are above the diagonal.
tedd-c versus Marcie
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for Marcie, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to Marcie are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | Marcie | Both tools | tedd-c | Marcie | ||
| All computed OK | 479 | 5 | 626 | Smallest Memory Footprint | ||
| tedd-c = Marcie | — | — | 0 | Times tool wins | 1033 | 86 |
| tedd-c > Marcie | — | — | 9 | Shortest Execution Time | ||
| tedd-c < Marcie | — | — | 0 | Times tool wins | 1041 | 78 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 5 | 479 | 498 | |||
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-c
computed more values than Marcie,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, Marcie wins when points are above the diagonal.
tedd-c versus pnmc
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for pnmc, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to pnmc are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | pnmc | Both tools | tedd-c | pnmc | ||
| All computed OK | 277 | 22 | 0 | Smallest Memory Footprint | ||
| tedd-c = pnmc | — | — | 0 | Times tool wins | 705 | 431 |
| tedd-c > pnmc | — | — | 837 | Shortest Execution Time | ||
| tedd-c < pnmc | — | — | 0 | Times tool wins | 608 | 528 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 0 | 0 | |||
| Cannot Compute + Time-out | 22 | 277 | 481 | |||
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-c
computed more values than pnmc,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, pnmc wins when points are above the diagonal.
tedd-c versus Smart
Some statistics are displayed below, based on 3234 runs (1617 for tedd-c and 1617 for Smart, so there are 1617 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing tedd-c to Smart are shown (you may click on one graph to enlarge it).
| Statistics on the executions | ||||||
| tedd-c | Smart | Both tools | tedd-c | Smart | ||
| All computed OK | 539 | 7 | 568 | Smallest Memory Footprint | ||
| tedd-c = Smart | — | — | 0 | Times tool wins | 668 | 453 |
| tedd-c > Smart | — | — | 7 | Shortest Execution Time | ||
| tedd-c < Smart | — | — | 0 | Times tool wins | 991 | 130 |
| Do not compete | 0 | 0 | 0 | |||
| Error detected | 0 | 25 | 0 | |||
| Cannot Compute + Time-out | 10 | 517 | 493 | |||
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-c
computed more values than Smart,
denote cases where tedd-c
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.
tedd-c wins when points are below the diagonal, Smart wins when points are above the diagonal.
