Learning regular sets from queries and counterexamples
Information and Computation
Inference of finite automata using homing sequences
Information and Computation
Characterizations of rational &ohgr;-languages by means of right congruences
Theoretical Computer Science
On the learnability of infinitary regular sets
Information and Computation
Ultimately Periodic Words of Rational w-Languages
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
A Hierarchy of Temporal Properties
A Hierarchy of Temporal Properties
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
GOAL: a graphical tool for manipulating Büchi automata and temporal formulae
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
Automated assumption generation for compositional verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
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
Local Proofs for Linear-Time Properties of Concurrent Programs
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Assume-guarantee reasoning with local specifications
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
Automated assume-guarantee reasoning through implicit learning
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
A dash of fairness for compositional reasoning
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Compositional probabilistic verification through multi-objective model checking
Information and Computation
| Hi-index | 0.00 |
Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the automaton synthesis paradigm for the infinitary languages by presenting an algorithm to learn an arbitrary regular set of infinite sequences (an ω-regular language) over an alphabet Σ. Our main result is an algorithm to learn a nondeterministic Büchi automaton that recognizes an unknown ω-regular language. This is done by learning a unique projection of it on Σ* using the framework suggested by Angluin for learning regular subsets of Σ*.