Abstract
We present and analyse an algorithm that quickly finds falsifying inputs for hybrid systems. Our method is based on a probabilistically directed tree search, whose distribution adapts to consider an increasingly fine-grained discretization of the input space. In experiments with standard benchmarks, our algorithm shows comparable or better performance to existing techniques, yet it does not build an explicit model of a system. Instead, at each decision point within a single trial, it makes an uninformed probabilistic choice between simple strategies to extend the input signal by means of exploration or exploitation. Key to our approach is the way input signal space is decomposed into levels, such that coarse segments are more probable than fine segments. We perform experiments to demonstrate how and why our approach works, finding that a fully randomized exploration strategy performs as well as our original algorithm that exploits robustness. We propose this strategy as a new baseline for falsification and conclude that more discriminative benchmarks are required.
Dokumententyp: | Zeitschriftenartikel |
---|---|
Fakultät: | Biologie > Department Biologie I |
Themengebiete: | 500 Naturwissenschaften und Mathematik > 570 Biowissenschaften; Biologie |
ISSN: | 1049-3301 |
Sprache: | Englisch |
Dokumenten ID: | 97962 |
Datum der Veröffentlichung auf Open Access LMU: | 05. Jun. 2023, 15:27 |
Letzte Änderungen: | 17. Okt. 2023, 14:57 |