Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Learning regular sets from queries and counterexamples
Information and Computation
Handbook of theoretical computer science (vol. B)
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Theoretical Computer Science
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A structural induction theorem for processes
Information and Computation
A new algorithm for the reduction of incompletely specified finite state machines
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Symbolic manipulation of Boolean functions using a graphical representation
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Model checking
Efficient Algorithms for the Inference of Minimum Size DFAs
Machine Learning
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Liveness and Acceleration in Parameterized Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On the Competeness of Compositional Reasoning
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
Learning to verify branching time properties
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
On the Synthesis of Finite-State Machines from Samples of Their Behavior
IEEE Transactions on Computers
Regular Model Checking Using Inference of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Insights to Angluin's Learning
Electronic Notes in Theoretical Computer Science (ENTCS)
Bridging the gap between fair simulation and trace inclusion
Information and Computation
Learning a regular tree language from a teacher
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Replaying play in and play out: synthesis of design models from scenarios by learning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Assume-guarantee software verification based on game semantics
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Inferring network invariants automatically
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the correspondence between conformance testing and regular inference
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Using language inference to verify omega-regular properties
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Environment abstraction for parameterized verification
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Actively learning to verify safety for FIFO automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Inference of event-recording automata using timed decision trees
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Regular inference for state machines with parameters
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
LearnLib: a library for automata learning and experimentation
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A theory of history dependent abstractions for learning interface automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Learning minimal deterministic automata from inexperienced teachers
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Formal modeling of robot behavior with learning
Neural Computation
| Hi-index | 0.00 |
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.