Abstract. Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of techniques adopted from automata learning. In this paper we establish a common framework to investigate the similarities of these techniques by showing how results in one area can be transferred to results in the other and to explain the reasons for their differences.
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Input-output conformance test theory for discrete systems has established itself in research and ind...
Abstract. This paper addresses the problem of off-line selection of test cases for testing the confo...
A new test generation method and algorithm for conformance testing is proposed. It is based on the i...
In the present work we study methods for testing regular inference algorithms. First there are intro...
The ever-increasing reliance on digital systems has dramatically increased the emphasis on the relia...
Abstract. Conformance testing is the problem of constructing a com-plete test suite of inputs based ...
In this technical report, a comprehensive testing theory for model-based testing against symbolic ni...
Abstract. Existing algorithms for regular inference (aka automata learn-ing) allows to infer a finit...
This chapter presents principles and techniques for model-based black-box conformance testing of rea...
This work presents an executable model-based testing framework for probabilistic systems with non-de...
This paper refines the framework of ‘Formal Methods in Conformance Testing’ by introducing probabili...
International audienceThis paper addresses the problem of off-line selection of test cases for testi...
In Model-Based Design of Cyber-Physical Systems (CPS), it is often desirable to develop several mode...
Abstract. We propose abstract regular model checking as a new generic tech-nique for verification of...
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Input-output conformance test theory for discrete systems has established itself in research and ind...
Abstract. This paper addresses the problem of off-line selection of test cases for testing the confo...
A new test generation method and algorithm for conformance testing is proposed. It is based on the i...
In the present work we study methods for testing regular inference algorithms. First there are intro...
The ever-increasing reliance on digital systems has dramatically increased the emphasis on the relia...
Abstract. Conformance testing is the problem of constructing a com-plete test suite of inputs based ...
In this technical report, a comprehensive testing theory for model-based testing against symbolic ni...
Abstract. Existing algorithms for regular inference (aka automata learn-ing) allows to infer a finit...
This chapter presents principles and techniques for model-based black-box conformance testing of rea...
This work presents an executable model-based testing framework for probabilistic systems with non-de...
This paper refines the framework of ‘Formal Methods in Conformance Testing’ by introducing probabili...
International audienceThis paper addresses the problem of off-line selection of test cases for testi...
In Model-Based Design of Cyber-Physical Systems (CPS), it is often desirable to develop several mode...
Abstract. We propose abstract regular model checking as a new generic tech-nique for verification of...
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Input-output conformance test theory for discrete systems has established itself in research and ind...
Abstract. This paper addresses the problem of off-line selection of test cases for testing the confo...