In the present work we study methods for testing regular inference algorithms. First there are introduced some theoretical basics for finite state automata and regular inference. Next we present some finite state automata learning algorithms, their principles and used testing methods, which find out algorithms quality via testing resulting automata. Following text makes the training and testing data generating process clear, describes format for saving this data and for saving finite state automata and finally the algorithms testing run alone, too. The application implementing present testing methods is a part of this work as well. It saves result statistics in chosen format. In appendices we append user and programmer documentation for thi...
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Abstract. Existing algorithms for regular inference (aka automata learn-ing) allows to infer a finit...
We provide a survey of methods for inferring the structure of a finite automaton from passive observ...
In the present work we study methods for testing regular inference algorithms. First there are intro...
AbstractDeveloping efficient and automatic testing techniques is one of the major challenges facing ...
International audienceDeveloping efficient and automatic testing techniques is one of the major chal...
Abstract. In this paper, we give an overview on some algorithms for learning automata. Starting with...
The Software Reliability group at KTH-CSC has designed and built a novel test platform LBTest for bl...
Stochastic automata operating in an unknown random environment have been proposed earlier as models ...
This paper describes new and efficient algorithms for learning deterministic finite automata. Our ap...
Abstract. Conformance testing for finite state machines and regular inference both aim at identifyin...
Automata learning is an established class of techniques for inferring automata models by observing h...
Unsupervised learning of finite automata has been proven to be NP-hard. However, there are many real...
Formal models are often used to describe the behavior of a computer program or component. Behavioral...
Abstract—We present a new algorithm IDS for incremental learning of deterministic finite automata (D...
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Abstract. Existing algorithms for regular inference (aka automata learn-ing) allows to infer a finit...
We provide a survey of methods for inferring the structure of a finite automaton from passive observ...
In the present work we study methods for testing regular inference algorithms. First there are intro...
AbstractDeveloping efficient and automatic testing techniques is one of the major challenges facing ...
International audienceDeveloping efficient and automatic testing techniques is one of the major chal...
Abstract. In this paper, we give an overview on some algorithms for learning automata. Starting with...
The Software Reliability group at KTH-CSC has designed and built a novel test platform LBTest for bl...
Stochastic automata operating in an unknown random environment have been proposed earlier as models ...
This paper describes new and efficient algorithms for learning deterministic finite automata. Our ap...
Abstract. Conformance testing for finite state machines and regular inference both aim at identifyin...
Automata learning is an established class of techniques for inferring automata models by observing h...
Unsupervised learning of finite automata has been proven to be NP-hard. However, there are many real...
Formal models are often used to describe the behavior of a computer program or component. Behavioral...
Abstract—We present a new algorithm IDS for incremental learning of deterministic finite automata (D...
Regular model checking is a method for verifying infinite-state systems based on coding their config...
Abstract. Existing algorithms for regular inference (aka automata learn-ing) allows to infer a finit...
We provide a survey of methods for inferring the structure of a finite automaton from passive observ...