Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
摘要：
Summary: 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 $Σ^{*}$.
展开
会议名称：
Tools & Algorithms for the Construction & Analysis of Systems, International Conference, Tacas, Held As Part of the Joint European Conferences on Theory & Practice of Software, Etaps, Budapest, Hungary, March 29-april 6, Proceedi
会议时间：
2009
主办单位：
DBLP
被引量：
热门文献
Springer
Springer
(全网免费下载)
Semantic Scholar
(全网免费下载)
掌桥科研
dx.doi.org
查看更多
AMS
ResearchGate
Citeseer
Citeseer
(全网免费下载)
zentralblatt-math.org
core.ac.uk
reports-archive.adm.cs.cmu.edu
reports-archive.adm.cs.cmu.edu
(全网免费下载)
ra.adm.cs.cmu.edu
cs.toronto.edu
(全网免费下载)
ra.adm.cs.cmu.edu
(全网免费下载)
cs.cmu.edu
(全网免费下载)
cs.utoronto.ca
(全网免费下载)
webcourse.cs.technion.ac.il
(全网免费下载)
iis.sinica.edu.tw
(全网免费下载)
Springer
(全网免费下载)
Semantic Scholar
(全网免费下载)
Citeseer
(全网免费下载)
iis.sinica.edu.tw
(全网免费下载)
cs.toronto.edu
(全网免费下载)
ra.adm.cs.cmu.edu
(全网免费下载)
reports-archive.adm.cs.cmu.edu
(全网免费下载)
webcourse.cs.technion.ac.il
(全网免费下载)
cs.cmu.edu
(全网免费下载)
cs.utoronto.ca
(全网免费下载)
通过文献互助平台发起求助，成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
引用走势
站内活动
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
