Randomized reachability analysis in UPPAAL: fast error detection in timed systems

Randomized reachability analysis is an efficient method for detection of safety violations. Due to the under-approximate nature of the method, it excels at quick falsification of models and can greatly improve the model-based development process: using lightweight randomized methods early in the dev...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal on software tools for technology transfer Ročník 24; číslo 6; s. 1025 - 1042
Hlavní autoři: Kiviriga, Andrej, Larsen, Kim Guldstrand, Nyman, Ulrik
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2022
Springer Nature B.V
Témata:
Case studies
Computer Science
Error analysis
Error correction & detection
Error detection
Explosions
Methods
Scheduling
Software
Software Engineering
Software Engineering/Programming and Operating Systems
Statistical models
Stopwatches
Theory of Computation
Violations
State space explosion
Schedulability analysis
Stopwatch automata
Randomized
Timed automata
Model-checking
ISSN:1433-2779, 1433-2787
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Randomized reachability analysis is an efficient method for detection of safety violations. Due to the under-approximate nature of the method, it excels at quick falsification of models and can greatly improve the model-based development process: using lightweight randomized methods early in the development for the discovery of bugs, followed by expensive symbolic verification only at the very end. We show the scalability of our method on a number of timed automata and stopwatch automata models of varying sizes and origin. Among them, we revisit the schedulability problem from the Herschel–Planck industrial case study, where our new method finds the deadline violation three orders of magnitude faster: some cases could previously be analyzed by statistical model checking in 23 h and can now be checked in 23 s. Moreover, a deadline violation is discovered in a number of cases that were previously intractable. We have implemented the Randomized reachability analysis—and made it available—in the tool Uppaal . Finally, we provide an evaluation of the strengths and weaknesses of Random reachability analysis exploring exactly which types of model features hamper method’s efficiency.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-022-00681-z