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.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Farzan, A., Chen, Y. F., Clarke, E. M., Tsay, Y. K., & Wang, B. Y. (2008). Extending automated compositional verification to the full class of omega-regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4963 LNCS, pp. 2–17). https://doi.org/10.1007/978-3-540-78800-3_2
Readers over time
Readers' Seniority
Readers' Discipline
