Filters








1,666 Hits in 3.2 sec

IDS: An Incremental Learning Algorithm for Finite Automata [article]

Muddassar A. Sindhu, Karl Meinke
2012 arXiv   pre-print
We present a new algorithm IDS for incremental learning of deterministic finite automata (DFA). This algorithm is based on the concept of distinguishing sequences introduced in (Angluin81).  ...  We conclude that IDS is an efficient algorithm for software engineering applications of automata learning, such as testing and model inference.  ...  We have presented two versions of the IDS algorithm which is an incremental algorithm for learning DFA in polynomial time.  ... 
arXiv:1206.2691v1 fatcat:ghw54jrfrbgmfozwcin3meewoa

Demonstration of an Operational Procedure for the Model-Based Testing of CTI Systems [chapter]

Andreas Hagerer, Hardi Hungar, Tiziana Margaria, Oliver Niese, Bernhard Steffen, Hans-Dieter Ide
2002 Lecture Notes in Computer Science  
In this demonstration we illustrate how a posteriori modeling of complex, heterogeneous, and distributed systems is practically performed within an automated integrated testing environment (ITE) to give  ...  Regular extrapolation builds models from observations via techniques from machine learning and finite automata theory.  ...  These descriptions come in the form of extended finite automata tailored for automatically producing system tests, grading test suites and monitoring running systems.  ... 
doi:10.1007/3-540-45923-5_25 fatcat:r3csok6bxfbw7nw55nqeplkjgu

An Efficient Model Inference Algorithm for Learning-based Testing of Reactive Systems [article]

Muddassar A. Sindhu
2020 arXiv   pre-print
In this paper we describe the IKL learning algorithm which is an active incremental learning algorithm for deterministic Kripke structures. We formally prove the correctness of IKL.  ...  Learning-based testing (LBT) is an emerging methodology to automate iterative black-box requirements testing of software systems.  ...  We gratefully acknowledge financial support for this research from the Swedish Research Council (VR), the Higher Education Commission (HEC) of Pakistan, and the European Union under project HATS FP7-231620  ... 
arXiv:2008.06268v1 fatcat:e5cc6ktqandkng2di7nftoo5d4

A Survey about various Generations of Lexical Analyzer

Zakiya Ali Nayef
2019 Journal of Advanced Computer Science & Technology  
Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata.  ...  This study gives a view on different lexical analyzer generators that has been implemented for different purposes in finite automata.  ...  Automata Simulation Tool (jFAST).jFAST is an instructional software package used as an easy learning and easy-to-use software tool for teachers and students in order to determine and see the insights  ... 
doi:10.14419/jacst.v8i2.29881 fatcat:gp6devm4yrfcpas5bunww4vy2a

Natural Language Information Retrieval Tomek Strzalkowski (editor) Dordrecht: Kluwer Academic Publishers (Text, speech and language technology series, edited by Nancy Ide and Jean Véronis, volume 7), 1999, xxv+384 pp; hardbound, ISBN 0-7923-5685-3, $144.00, £84, Dfl 240.00

Simon Corston-Oliver
2000 Computational Linguistics  
They provide an overview of finite-state automata for morphological analysis and rule ordering for derivational affixation in French, with a tangential section on Spanish.  ...  ," gives an overview of linguistically motivated indexing (LMI) and nonlinguistic indexing (NLI).  ...  They provide an overview of finite-state automata for morphological analysis and rule ordering for derivational affixation in French, with a tangential section on Spanish.  ... 
doi:10.1162/coli.2000.26.3.460 fatcat:hovane3gwncjjboleqx5t52lrq

A polynomial time incremental algorithm for learning DFA [chapter]

Rajesh Parekh, Codrin Nichitiu, Vasant Honavar
1998 Lecture Notes in Computer Science  
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA) from labeled examples and membership queries.  ...  This algorithm is an extension of Angluin's ID procedure to an incremental framework.  ...  Rajesh Parekh is thankful to the Allstate Research and Planning Center for the research support provided to him.  ... 
doi:10.1007/bfb0054062 fatcat:3cyxa574xrf35dgrjwr2apxwpe

Learning Automata-Based Complex Event Patterns in Answer Set Programming [article]

Nikos Katzouris, Georgios Paliouras
2022 arXiv   pre-print
We present such a learning approach in ASP and an incremental version thereof that trades optimality for efficiency and is capable to scale to large datasets.  ...  We evaluate our approach on two CER datasets and compare it to state-of-the-art automata learning techniques, demonstrating empirically a superior performance, both in terms of predictive accuracy and  ...  All aforementioned algorithms learn classical automata.  ... 
arXiv:2208.14820v1 fatcat:wkpuk52ctjcyrmlokrn5lfxuqy

On (Omega-)Regular Model Checking [article]

Axel Legay, Pierre Wolper
2008 arXiv   pre-print
Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transitions.  ...  This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performances  ...  Thanks We thank Bernard Boigelot for a fruitful collaboration on preliminary versions of this work.  ... 
arXiv:0809.2214v1 fatcat:2qpicd4dhzalbfksd4d7h5ugsm

A Categorical Framework for Learning Generalised Tree Automata [article]

Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva
2022 arXiv   pre-print
We instantiate the abstract theory to a large class of Set functors, by which we recover for the first time practical tree automata learning algorithms from an abstract framework and at the same time obtain  ...  Much research went into devising ad hoc adaptations of algorithms for different types of automata.  ...  So far this has led the authors to develop an abstract automata learning algorithm that generalises algorithms for DFAs, weighted automata, and subsequential transducers.  ... 
arXiv:2001.05786v2 fatcat:asqpica7evhybacn4zmwzwamxm

Liveness of Randomised Parameterised Systems under Arbitrary Schedulers [chapter]

Anthony W. Lin, Philipp Rümmer
2016 Lecture Notes in Computer Science  
The method is incremental and exploits both Angluin-style L*-learning and SAT-solvers.  ...  We introduce an automatic method of proving liveness for randomised parameterised systems under arbitrary schedulers.  ...  We thank anonymous referees, Parosh Abdulla, Bengt Jonsson, Ondrej Lengal, Rupak Majumdar, and Ahmed Rezine for their helpful feedback.  ... 
doi:10.1007/978-3-319-41540-6_7 fatcat:ar5gialrcnfwnooh5kc5zewycu

Learning Regular Languages Using Nondeterministic Finite Automata [chapter]

Pedro García, Manuel Vázquez de Parga, Gloria I. Álvarez, José Ruiz
2008 Lecture Notes in Computer Science  
A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge.  ...  The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task.  ...  Grammatical Inference Regular language learning is the process of learning an unknown regular language from a finite set of labeled examples.  ... 
doi:10.1007/978-3-540-70844-5_10 fatcat:jly67lhttze2hidlwfbxl7zbtm

Optimizing Automata Learning via Monads [article]

Gerco van Heerdt and Matteo Sammartino and Alexandra Silva
2019 arXiv   pre-print
The former perspective on monads allows us to develop a new algorithm and accompanying correctness proofs, building upon a general framework for automata learning based on category theory.  ...  Automata learning has been successfully applied in the verification of hardware and software.  ...  The algorithm incrementally builds an observation table.  ... 
arXiv:1704.08055v4 fatcat:4e4houzbefe63ioiel4vyxvuma

Omega-Regular Model Checking [chapter]

Bernard Boigelot, Axel Legay, Pierre Wolper
2004 Lecture Notes in Computer Science  
Due to these advantages and properties, one can show that the technique developed for the finite word case can directly be adapted to weak deterministic Büchi automata up to algorithmic modifications.  ...  To avoid the hard to implement algorithms needed for some operations on infinite-word automata, only omega-regular sets that can be defined by weak deterministic Büchi automata [Muller et al. 1986 ] are  ...  Thanks We thank Bernard Boigelot for a fruitful collaboration on preliminary versions of this work. We are grateful to Frederic Herbreteau who helped us with HAT.  ... 
doi:10.1007/978-3-540-24730-2_41 fatcat:gmipr4rdlnbyxnbodifax5oqhq

On (Omega-)regular model checking

Axel Legay, Pierre Wolper
2010 ACM Transactions on Computational Logic  
Due to these advantages and properties, one can show that the technique developed for the finite word case can directly be adapted to weak deterministic Büchi automata up to algorithmic modifications.  ...  To avoid the hard to implement algorithms needed for some operations on infinite-word automata, only omega-regular sets that can be defined by weak deterministic Büchi automata [Muller et al. 1986 ] are  ...  Thanks We thank Bernard Boigelot for a fruitful collaboration on preliminary versions of this work. We are grateful to Frederic Herbreteau who helped us with HAT.  ... 
doi:10.1145/1838552.1838554 fatcat:jii2bh45kve7thy6yk7pifb2li

LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Javad Akbari Torkestani, Mohammad Reza Meybodi
2011 Computers & electrical engineering  
In this paper, we propose a localized learning automata-based clustering algorithm for wireless ad hoc networks.  ...  The proposed algorithm can be independently localized at each host.  ...  Learning automata A learning automaton [16] [17] [18] is an adaptive decision-making unit that improves its performance by learning how to choose the optimal action from a finite set of allowed actions  ... 
doi:10.1016/j.compeleceng.2011.05.006 fatcat:2dc5lg4jabhmdcrhx5pyxyttvm
« Previous Showing results 1 — 15 out of 1,666 results