Professor Lijun Zhang (Institute of Software, Chinese Academy of Sciences) is going to lecture on
Learning Büchi automata and its applications
at the lecture room H6 of the Department of Informatics, Aristotle University of Thessaloniki (Mezzanine, Building of Biology) on Tuesday April 16th, 2019 at 12:15.
In this work, we review an algorithm that learns a Büchi automaton from a teacher who knows an ω-regular language; the algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman. We introduce the learning algorithm by learning the simple ω-regular language (ab)ω : besides giving an overview of the algorithm, we guide the audience on how the algorithm works step by step. Further, we demonstrate how the learning algorithm can be exploited in classical automata operations such as complementation checking and in the context of termination analysis.
About the Speaker:
Professor Chinese Academy of Sciences, Beijing, China
Director of Sino-European Joint Institute of Dependable Smart Software
Inst. of Intelligent Software, Guangzhou, China
I am a research professor at State Key Laboratory of Computer Science, Institute of Software Chinese Academy of Sciences. I was an associate professor at Language-Based Technology section, DTU Compute, Technical University of Denmark. Before this I was a postdoctoral researcher at University of Oxford. I gained a Diploma Degree and a PhD (Dr. Ing.) at Universität des Saarlandes. My research interests include: probabilistic models, simulation reduction, decision algorithms for probabilistic simulation preorders, abstraction and model checking. I am involved in the following tools: PASS, PARAM ProHVer, INFAMY, FlowSim. Further, I am leading the development of the model checker IscasMC.