Learning I/O Automata

Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy machines. It is shown that, by exploiting these links, any tool for active learning of Mealy machines can be used for learning I/O automata that are deterministic and output determined. The main idea is to place a transducer in between the I/O automata teacher and the Mealy machine learner, which translates concepts from the world of I/O automata to the world of Mealy machines, and vice versa. The transducer comes equipped with an interface automaton that allows us to focus the learning process on those parts of the behavior that can effectively be tested and/or are of particular interest. The approach has been implemented on top of the LearnLib tool and has been applied successfully to three case studies.

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

[2]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[3]  Nikolaj Bjørner,et al.  Input-Output Model Programs , 2009, ICTAC.

[4]  Carroll Morgan,et al.  Theoretical Aspects of Computing - ICTAC 2009 , 2009, Lecture Notes in Computer Science.

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

[6]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[7]  Henning Schulzrinne,et al.  Reliability of Provisional Responses in Session Initiation Protocol (SIP) , 2002, RFC.

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

[9]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[10]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs and Repetitive Quiescence , 1996, Softw. Concepts Tools.

[11]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

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

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

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

[15]  Fides Aarts,et al.  Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction , 2010, ICTSS.

[16]  Frits W. Vaandrager,et al.  Inference and Abstraction of the Biometric Passport , 2010, ISoLA.

[17]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[18]  Martin Leucker,et al.  Learning Meets Verification , 2006, FMCO.

[19]  Harald Raffelt,et al.  LearnLib: a library for automata learning and experimentation , 2005, FMICS '05.

[20]  Erik Poll,et al.  Model-Based Testing of Electronic Passports , 2009, FMICS.

[21]  Bengt Jonsson,et al.  Modular verification of asynchronous networks , 1987, PODC '87.

[22]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[23]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[24]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[25]  Jan Tretmans.  Inference and Abstraction of Communication Protocols ? , 2009 .

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

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

[28]  Boudewijn R. Haverkort,et al.  Formal Methods: Applications and Technology, 11th International Workshop, FMICS 2006 and 5th International Workshop PDMC 2006, Bonn, Germany, August 26-27, and August 31, 2006, Revised Selected Papers , 2007, FMICS/PDMC.

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

[30]  Mark Handley,et al.  SIP: Session Initiation Protocol , 1999, RFC.

[31]  Thomas A Henzinger,et al.  Two challenges in embedded systems design: predictability and robustness , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[32]  Tim A. C. Willemse.  Heuristics for ioco -Based Test-Based Modelling , 2006, FMICS/PDMC.

[33]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[34]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[35]  Prakash Panangaden,et al.  Computations, Residuals, and the POwer of Indeterminancy , 1988, ICALP.