3,780 Hits in 2.5 sec

Automata techniques for query inference machines

William Gasarch, Geoffrey R. Hird
2002 Annals of Pure and Applied Logic  
Essentially, once we have a result for queries to [S, <] 2 , we can obtain the same result for many different languages. We obtain easier proofs of old results and several new results.  ...  The answer depended on the query language chosen. In this paper we develop a framework (reductions) for studying this question.  ...  Acknowledgement We would like to thank Kalvis Apsītis, Mark Bickford, Andrew Lee, and Mark Pleszkoch, for proofreading and discussion.  ... 
doi:10.1016/s0168-0072(01)00115-4 fatcat:5clc4pmosrfshmfagrp5i66a5u

Combining Black-Box and White-Box Techniques for Learning Register Automata [chapter]

Falk Howar, Bengt Jonsson, Frits Vaandrager
2019 Lecture Notes in Computer Science  
The underlying theoretic framework (active automata learning) was first introduced in a landmark paper by Dana Angluin in 1987 for finite state machines.  ...  Such techniques infer guards over data parameters and assignments from observations of test output.  ...  The authors of [10] present a technique for inferring symbolic Mealy machines, i.e., automata with guarded transitions and state-local sets of registers.  ... 
doi:10.1007/978-3-319-91908-9_26 fatcat:jqjz3fm5ivbdni62vt2mukjmle

libalf: The Automata Learning Framework [chapter]

Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon
2010 Lecture Notes in Computer Science  
This paper presents libalf, a comprehensive, open-source library for learning formal languages. libalf covers various well-known learning techniques for finite automata (e.g.  ...  Its modular design and C++ implementation make it a suitable platform for adding and engineering further learning algorithms for new target models (e.g., Büchi automata).  ...  The LearnLib implements Angluin's L * algorithm for inferring DFA and some slight variants for deriving Mealy machines.  ... 
doi:10.1007/978-3-642-14295-6_32 fatcat:2sngy2rnxjeixmh3y5rfr3tkji

A bibliographical study of grammatical inference

Colin de la Higuera
2005 Pattern Recognition  
The field of grammatical inference (also known as grammar induction) is transversal to a number of research areas including machine learning, formal language theory, syntactic and structural pattern recognition  ...  This makes research in this subject very hard, mainly for a beginner or someone who does not wish to become a specialist but just to find the most suitable ideas for his own research activity.  ...  ) required new techniques for grammatical inference.  ... 
doi:10.1016/j.patcog.2005.01.003 fatcat:62qwskiqcvddjobakbdshwebqq

Active Automata Learning in Practice [chapter]

Falk Howar, Bernhard Steffen
2018 Lecture Notes in Computer Science  
As systems become ever more complex and development becomes more distributed, inferred models of system behavior become an increasingly valuable asset for understanding and analyzing a system's behavior  ...  In this paper we review the progress that has been made over the past five years, assess the status of active automata learning techniques with respect to applications in the field of software engineering  ...  Medhat et al. present an approach for mining hybrid automata specifications from input/output traces using several machine learning techniques [108] .  ... 
doi:10.1007/978-3-319-96562-8_5 fatcat:jtpzftrzvzf3tdtbncntfc4s4q

Model Learning: A Survey on Foundation, Tools and Applications [article]

Shahbaz Ali and Hailong Sun and Yongwang Zhao
2018 arXiv   pre-print
Formal models form the basis and are prerequisite for the application of these techniques.  ...  This paper also surveys the successful applications of model learning technique in multidisciplinary fields making it promising for testing and verification of realistic systems.  ...  Markus Frohme TU Dortmund for valuable discussions and generous sup-  ... 
arXiv:1901.01910v1 fatcat:ttfnf3elxfhjvdvtid5tzsmfbm

Learning register automata: from languages to program structures

Malte Isberner, Falk Howar, Bernhard Steffen
2013 Machine Learning  
for systems with (data) output, automated alphabet abstraction refinement techniques as a twodimensional extension of the partition-refinement based approach of active automata learning to also inferring  ...  A large share of this development was guided and motivated by the increasingly popular application of grammatical inference techniques in the field of software engineering.  ...  Using this approach, Berg et al. (2008) present a technique for inferring symbolic Mealy machines, i.e., automata with guarded transitions and statelocal sets of registers.  ... 
doi:10.1007/s10994-013-5419-7 fatcat:wz3atcp7vjcf7irzgejh45a2li

Model Learning and Model-Based Testing [chapter]

Bernhard K. Aichernig, Wojciech Mostowski, Mohammad Reza Mousavi, Martin Tappler, Masoumeh Taromirad
2018 Lecture Notes in Computer Science  
Types of models: different types of models have been learned and have been used for model-based testing.  ...  However, this classification gives us a general overview and a measure of matching between different learning and testing techniques. 2.  ...  Another randomized conformance testing technique for automata learning has been presented in [AT17a].  ... 
doi:10.1007/978-3-319-96562-8_3 fatcat:qrz24l2twrh5rp7ltpyxo4ooii

Machine Learning for Dynamic Software Analysis: Potentials and Limits (Dagstuhl Seminar 16172)

Amel Bennaceur, Dimitra Giannakopoulou, Reiner Hähnle, Karl Meinke, Marc Herbstritt
2016 Dagstuhl Reports  
The organisers would like to express their gratitude to the participants and the Schloss Dagstuhl team for a productive and exciting seminar. Learning and Testing  ...  Other glass-box techniques may be useful for as a basis for implementing equivalence queries or new kinds of queries that can speed up the learning process (e.g., that after some prefix a certain behaviour  ...  Using Glass-Box Techniques in Learning A second idea was using glass-box techniques in automata learning.  ... 
doi:10.4230/dagrep.6.4.161 dblp:journals/dagstuhl-reports/BennaceurGHM16 fatcat:7t3jl5y7dfanfjeev3k42nmfau

Learning I/O Automata [chapter]

Fides Aarts, Frits Vaandrager
2010 Lecture Notes in Computer Science  
It is shown that, by exploiting these links, any tool for active learning of Mealy machines can be used for learning I/O automata that are deterministic and output determined.  ...  Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy machines.  ...  Acknowledgement Many thanks to Bengt Jonsson, Bernhard Steffen, Jan Tretmans and the anonymous referees for inspiring discussions and/or pointers to the literature, and to Falk Howar for his generous LearnLib  ... 
doi:10.1007/978-3-642-15375-4_6 fatcat:weiewer6pfakdjopsamwqxpaiq

Algorithms for Inferring Register Automata [chapter]

Fides Aarts, Falk Howar, Harco Kuppens, Frits Vaandrager
2014 Lecture Notes in Computer Science  
In recent years, two different approaches for learning register automata have been developed: as part of the LearnLib tool algorithms have been implemented that are based on the Nerode congruence for register  ...  automata, whereas the Tomte tool implements algorithms that use counterexample-guided abstraction refinement to automatically construct appropriate mappers.  ...  Model checking and automata learning are two core techniques in MDE.  ... 
doi:10.1007/978-3-662-45234-9_15 fatcat:p5hlhykxwncgnojv7y3u64sx7a

On the Correspondence Between Conformance Testing and Regular Inference [chapter]

Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen
2005 Lecture Notes in Computer Science  
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  ...  Recent work has employed techniques of automata learning, or regular inference [GPY02, HHNS02, HNS03, PVY99] .  ... 
doi:10.1007/978-3-540-31984-9_14 fatcat:wamsgtuvrfbdpbudq7dipxavhq

The Open-Source LearnLib [chapter]

Malte Isberner, Falk Howar, Bernhard Steffen
2015 Lecture Notes in Computer Science  
In this paper, we present LearnLib, a library for active automata learning.  ...  Like its immediate predecessor, the open-source LearnLib is written in Java to enable a high degree of flexibility and extensibility, while at the same time providing a performance that allows for large-scale  ...  techniques.  ... 
doi:10.1007/978-3-319-21690-4_32 fatcat:6krrr56jarhwxeztw2mb6xr2wi

Guest editorial to the special issue on grammatical inference

Georgios Paliouras, Yasubumi Sakakibara
2006 Machine Learning  
Grammatical inference is an established research field in Artificial Intelligence, dating back to the 60s and has been extensively addressed by researchers in automata theory, language acquisition, computational  ...  The main forum for presenting this type of work in the past 15 years has been the International Colloquium on Grammatical Inference (ICGI) which takes place in different countries and different continents  ...  The paper introduces Node Selecting Tree Transducers (NSTT), an adaptation of tree automata which enables one to express node selecting queries with tree automata, and discusses their relationship with  ... 
doi:10.1007/s10994-006-9776-3 fatcat:ta63gknbxvaotokjafv3m6ttpi

Reverse Engineering of Middleware for Verification of Robot Control Architectures [chapter]

Ali Khalili, Lorenzo Natale, Armando Tacchella
2014 Lecture Notes in Computer Science  
Both steps are carried out in a computer-assisted way using state-of-the-art techniques in automata-based identification and verification.  ...  In this scenario, the main challenge is that software correctness depends intrinsically on correct usage of middleware components, but structured models of such components might not be available for analysis  ...  A viable solution to this problem is to adopt automata-based identification techniques -see, e.g., [16] for a comprehensive list of references.  ... 
doi:10.1007/978-3-319-11900-7_27 fatcat:ffcgs5rchrgbbit62dcnuwwdma
« Previous Showing results 1 — 15 out of 3,780 results