Essays about: "Begränsad uttömmande sökning"
Found 2 essays containing the words Begränsad uttömmande sökning.
-
1. Bounded exhaustive generation of tests in model-based testing
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : There are some systems (or parts of systems) that are very critical and need especially good test suites to test them. For these critical systems, exhaustive testing may be a good way to test them. Thus, we have implemented two versions of bounded exhaustive search (BES) algorithms in a model-based testing tool called, Modbat. READ MORE
-
2. A Discrete Büchi Automata Distance for Formal Methods Based Control
University essay from KTH/ReglerteknikAbstract : Formal methods are valuable design validation techniques which ensure thecorrectness of hardware and software design. Recently, the formal methodstechnique of model checking using temporal logics has shown great promisein the field of control and task planning synthesis, as it allows for the formulationof complex tasks and provides an automatic and exhaustive search of allpossible paths. READ MORE