Introduction to Active Automata Learning from a Practical Perspective

In this chapter we give an introduction to active learning of Mealy machines, an automata model particularly suited for modeling the behavior of realistic reactive systems. Active learning is characterized by its alternation of an exploration phase and a testing phase. During exploration phases so-called membership queries are used to construct hypothesis models of a system under learning. In testing phases so-called equivalence queries are used to compare respective hypothesis models to the actual system. These two phases are iterated until a valid model of the target system is produced.

[1]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[2]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[3]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

[7]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[8]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

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

[10]  José L. Balcázar,et al.  Algorithms for Learning Finite Automata from Queries: A Unified View , 1997, Advances in Algorithms, Languages, and Complexity.

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

[12]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[13]  T. Margaria,et al.  Efficient Regression Testing of CTI-Systems : Testing a complex Call-Center Solution , 2001 .

[14]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

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

[16]  Hardi Hungar,et al.  Behavior-Based Model Construction , 2003, VMCAI.

[17]  Oliver Niese,et al.  An integrated approach to testing complex systems , 2003 .

[18]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[19]  Hardi Hungar,et al.  Domain-Specific Optimization in Automata Learning , 2003, CAV.

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

[21]  Tiziana Margaria,et al.  Efficient test-based model generation for legacy reactive systems , 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).

[22]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[23]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[24]  Manfred Broy,et al.  Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004] , 2005, Model-Based Testing of Reactive Systems.

[25]  Bengt Jonsson,et al.  On the Correspondence Between Conformance Testing and Regular Inference , 2005, FASE.

[26]  Tiziana Margaria,et al.  Knowledge-based relevance filtering for efficient system-level test-based model generation , 2005, Innovations in Systems and Software Engineering.

[27]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[28]  Bengt Jonsson,et al.  Inference of Event-Recording Automata Using Timed Decision Trees , 2006, CONCUR.

[29]  Bengt Jonsson,et al.  Regular Inference for State Machines with Parameters , 2006, FASE.

[30]  Tiziana Margaria,et al.  Model-Driven Development with the jABC , 2006, Haifa Verification Conference.

[31]  Tiziana Margaria,et al.  Dynamic Testing Via Automata Learning , 2007, Haifa Verification Conference.

[32]  Benedikt Bollig,et al.  Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning , 2007, TACAS.

[33]  Alexandre Petrenko,et al.  Testing of Software and Communicating Systems , 2007, Lecture Notes in Computer Science.

[34]  Keqin Li,et al.  Learning and Integration of Parameterized Components Through Testing , 2007, TestCom/FATES.

[35]  Keqin Li,et al.  Learning Parameterized State Machine Model for Integration Testing , 2007, 31st Annual International Computer Software and Applications Conference (COMPSAC 2007).

[36]  Howard Barringer,et al.  Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning , 2008, Formal Methods Syst. Des..

[37]  Jan Tretmans,et al.  Model Based Testing with Labelled Transition Systems , 2008, Formal Methods and Testing.

[38]  Benedikt Bollig,et al.  Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning , 2008, CONCUR.

[39]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

[40]  Bengt Jonsson,et al.  Regular Inference for State Machines Using Domains with Equality Tests , 2008, FASE.

[41]  Therese Bohlin,et al.  Regular Inference for Communication Protocol Entities , 2008 .

[42]  Tiziana Margaria,et al.  Hybrid test of web applications with webtest , 2008, TAV-WEB '08.

[43]  Marius Mikucionis,et al.  Formal Methods and Testing , 2008 .

[44]  Valérie Issarny,et al.  CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems , 2009, 2009 14th IEEE International Conference on Engineering of Complex Computer Systems.

[45]  Roland Groz,et al.  Inferring Mealy Machines , 2009, FM.

[46]  Colin de la Higuera,et al.  Zulu: An Interactive Learning Competition , 2009, FSMNLP.

[47]  Ana Cavalcanti,et al.  FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings , 2009, FM.

[48]  Tiziana Margaria,et al.  LearnLib: a framework for extrapolating behavioral models , 2009, International Journal on Software Tools for Technology Transfer.

[49]  Hongyang Qu,et al.  Assume-Guarantee Verification for Probabilistic Systems , 2010, TACAS.

[50]  Bengt Jonsson,et al.  On Handling Data in Automata Learning - Considerations from the CONNECT Perspective , 2010, ISoLA.

[51]  Colin de la Higuera,et al.  Grammatical Inference: Learning Automata and Grammars , 2010 .

[52]  Lorenzo Clemente,et al.  CONCUR 2010 - CONCURRENCY THEORY , 2010 .

[53]  Frits W. Vaandrager,et al.  Learning I/O Automata , 2010, CONCUR.

[54]  Valérie Issarny,et al.  Towards an Architecture for Runtime Interoperability , 2010, ISoLA.

[55]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[56]  Christian Wagner,et al.  Formalizing a Methodology for Design- and Runtime Self-Healing , 2010, 2010 Seventh IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems.

[57]  Bernhard Steffen,et al.  From ZULU to RERS - Lessons Learned in the ZULU Challenge , 2010, ISoLA.

[58]  Bengt Jonsson,et al.  Inferring Compact Models of Communication Protocol Entities , 2010, ISoLA.

[59]  Paola Inverardi,et al.  Application-Layer Connector Synthesis , 2011, SFM.

[60]  Valérie Issarny,et al.  The CONNECT Architecture , 2011, SFM.

[61]  Tiziana Margaria,et al.  Next Generation LearnLib , 2011, TACAS.

[62]  Yérom-David Bromberg,et al.  Middleware-Layer Connector Synthesis: Beyond State of the Art in Middleware Interoperability , 2011, SFM.

[63]  Antonello Calabrò,et al.  Dependability and Performance Assessment of Dynamic CONNECTed Systems , 2011, SFM.

[64]  Gordon S. Blair,et al.  Interoperability in Complex Distributed Systems , 2011, SFM.

[65]  Javier Esparza,et al.  Learning Workflow Petri Nets , 2010, Fundam. Informaticae.

[66]  Valérie Issarny,et al.  Formal Methods for Eternal Networked Software Systems , 2011, Lecture Notes in Computer Science.

[67]  Bernhard Steffen,et al.  Automata Learning with Automated Alphabet Abstraction Refinement , 2011, VMCAI.