Advertisement
Published in:
2008 | OriginalPaper | Chapter
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Authors : Azadeh Farzan, Yu-Fang Chen, Edmund M. Clarke, Yih-Kuen Tsay, Bow-Yaw Wang
Published in: Tools and Algorithms for the Construction and Analysis of Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
Σ
*
.