A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees

In this paper, we propose a novel algorithm to learn a Buchi automaton from a teacher who knows an \(\omega \)-regular language. The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman [10]. The main catch is that we use a classification tree structure instead of the standard observation table structure. The worst case storage space required by our algorithm is quadratically better than the table-based algorithm proposed in [10]. We implement the first publicly available library ROLL (Regular Omega Language Learning), which consists of all \(\omega \)-regular learning algorithms available in the literature and the new algorithms proposed in this paper. Experimental results show that our tree-based algorithms have the best performance among others regarding the number of solved learning tasks.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Benedikt Bollig,et al.  libalf: The Automata Learning Framework , 2010, CAV.

[3]  Farn Wang,et al.  PAC Learning-Based Verification and Model Synthesis , 2015, 2016 IEEE/ACM 38th International Conference on Software Engineering (ICSE).

[4]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[5]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[6]  J. R. Büchi.  Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic , 1966 .

[7]  Daniel Kroening,et al.  Learning the Language of Error , 2015, ATVA.

[8]  Parosh Aziz Abdulla,et al.  Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2011, CONCUR.

[9]  Ludwig Staiger,et al.  On Syntactic Congruences for Omega-Languages , 1993, Theor. Comput. Sci..

[10]  Zvonimir Rakamaric,et al.  Symbolic Learning of Component Interfaces , 2012, SAS.

[11]  Mihalis Yannakakis,et al.  Black Box Checking , 1999, FORTE.

[12]  Pavol Cerný,et al.  Synthesis of interface specifications for Java classes , 2005, POPL '05.

[13]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[14]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[15]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[16]  Parosh Aziz Abdulla,et al.  Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing , 2010, CAV.

[17]  Jun Sun,et al.  TzuYu: Learning stateful typestates , 2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[18]  Dana Fisman,et al.  Learning Regular Omega Languages , 2014, ALT.

[19]  Yih-Kuen Tsay,et al.  Büchi Store: An Open Repository of Büchi Automata , 2011, TACAS.

[20]  Hardi Hungar,et al.  Model Generation by Moderated Regular Extrapolation , 2002, FASE.

[21]  Dana Fisman,et al.  Families of DFAs as Acceptors of omega-Regular Languages , 2016, MFCS.

[22]  Neil D. Jones,et al.  The size-change principle for program termination , 2001, POPL '01.

[23]  Lijun Zhang,et al.  Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems , 2015, POPL.

[24]  Yih-Kuen Tsay,et al.  Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages , 2008, TACAS.

[25]  Dana Fisman,et al.  Families of DFAs as Acceptors of $ω$-Regular Languages , 2016, Log. Methods Comput. Sci..

[26]  Lu Feng,et al.  Automated Learning of Probabilistic Assumptions for Compositional Reasoning , 2011, FASE.

[27]  W. Marsden.  I and J , 2012 .

[28]  Bengt Jonsson,et al.  Generating models of infinite-state communication protocols using regular inference with abstraction , 2015, Formal Methods Syst. Des..

[29]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[30]  Zvonimir Rakamaric,et al.  Hybrid learning: interface generation through static, dynamic, and symbolic analysis , 2013, ISSTA.

[31]  Andreas Podelski,et al.  Ultimately Periodic Words of Rational w-Languages , 1993, MFPS.

[32]  Yih-Kuen Tsay,et al.  Learning Minimal Separating DFA's for Compositional Verification , 2009, TACAS.

[33]  Sagar Chaki,et al.  Automated Assume-Guarantee Reasoning for Simulation Conformance , 2005, CAV.

[34]  Farn Wang,et al.  Evolving a Test Oracle in Black-Box Testing , 2011, FASE.

[35]  Bernhard Steffen,et al.  Learning register automata: from languages to program structures , 2014, Machine Learning.

[36]  Bengt Jonsson,et al.  Inferring Canonical Register Automata , 2012, VMCAI.

[37]  Orna Grumberg,et al.  Learning-Based Compositional Model Checking of Behavioral UML Systems , 2015, FACS.

[38]  Jun Sun,et al.  Learning Assumptions for CompositionalVerification of Timed Systems , 2014, IEEE Transactions on Software Engineering.

[39]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[40]  Jun Sun,et al.  TLV: abstraction through testing, learning, and validation , 2015, ESEC/SIGSOFT FSE.

[41]  É. André,et al.  Learning assumptions for compositional verification of timed systems , 2013 .

[42]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[43]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[44]  Rajeev Alur,et al.  Symbolic Compositional Verification by Learning Assumptions , 2005, CAV.