1. Model-Based Testing of Probabilistic Systems
- Author
-
Gerhold, Marcus, Stoelinga, Mariëlle Ida Antoinette, Stevens, Perdita, and Wasowski, Andzej
- Subjects
Correctness ,Computer science ,0102 computer and information sciences ,02 engineering and technology ,computer.software_genre ,01 natural sciences ,Statistical hypothesis testing ,Completeness (order theory) ,0202 electrical engineering, electronic engineering, information engineering ,EC Grant Agreement nr.: FP7/318490 ,False rejection ,Soundness ,FMT-FMPA: FORMAL METHODS FOR PERFORMANCE ANALYSIS ,Model-based testing ,Probabilistic automaton ,Probabilistic logic ,Finite path ,020207 software engineering ,16. Peace & justice ,Trace distribution ,Test case ,010201 computation theory & mathematics ,Data mining ,computer - Abstract
This paper presents a model-based testing framework for probabilistic systems. We provide algorithms to generate, execute and evaluate test cases from a probabilistic requirements model. In doing so, we connect ioco-theory for model-based testing and statistical hypothesis testing: our ioco-style algorithms handle the functional aspects, while statistical methods, using $$\chi ^2$$i¾?2 tests and fitting functions, assess if the frequencies observed during test execution correspond to the probabilities specified in the requirements. Key results of our paper are the classical soundness and completeness properties, establishing the mathematical correctness of our framework; Soundness states that each test case is assigned the right verdict. Completeness states that the framework is powerful enough to discover each probabilistic deviation from the specification, with arbitrary precision. We illustrate the use of our framework via two case studies.
- Published
- 2016