Extending automated compositional verification to the full class of omega-regular languages

Abstract

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 ∑ *. © 2008 Springer-Verlag Berlin Heidelberg.