Learning event-driven switched linear systems

We propose an automata theoretic learning algorithm for the identification of black-box switched linear systems whose switching logics are event-driven. A switched system is expressed by a deterministic finite automaton (FA) whose node labels are the subsystem matrices. With information about the dimensions of the matrices and the set of events, and with access to two oracles, that can simulate the system on a given input, and provide counter-examples when given an incorrect hypothesis automaton, we provide an algorithm that outputs the unknown FA. Our algorithm first uses the oracle to obtain the node labels of the system run on a given input sequence of events, and then extends Angluin's \(L^*\)-algorithm to determine the FA that accepts the language of the given FA. We demonstrate the performance of our learning algorithm on a set of benchmark examples.

[1]  Stéphane Lecoeuche,et al.  A recursive identification algorithm for switched linear/affine models , 2011 .

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

[3]  Manfred Morari,et al.  A clustering technique for the identification of piecewise affine systems , 2001, Autom..

[4]  Mahesh Viswanathan,et al.  Minimization, Learning, and Conformance Testing of Boolean Programs , 2006, CONCUR.

[5]  Stephan Merz,et al.  Model Checking , 2000 .

[6]  Joshua Moerman.  Learning Product Automata , 2018, ICGI.

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

[8]  Wen-Guey Tzeng,et al.  Learning Probabilistic Automata and Markov Chains via Queries , 1992, Machine Learning.

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

[10]  W. P. M. H. Heemels,et al.  A Bayesian approach to identification of hybrid systems , 2004, IEEE Transactions on Automatic Control.

[11]  Alberto Bemporad,et al.  A bounded-error approach to piecewise affine system identification , 2005, IEEE Transactions on Automatic Control.

[12]  Bernhard K. Aichernig,et al.  Model Learning and Model-Based Testing , 2018, Machine Learning for Dynamic Software Analysis.

[13]  Leonor Becerra-Bonache,et al.  Learning Finite Automata Using Label Queries , 2009, ALT.

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

[15]  Mark Harman,et al.  The Oracle Problem in Software Testing: A Survey , 2015, IEEE Transactions on Software Engineering.

[16]  Martin Leucker,et al.  Inferring Network Invariants Automatically , 2006, IJCAR.

[17]  Gerhard Goos,et al.  Machine Learning for Dynamic Software Analysis: Potentials and Limits , 2018, Lecture Notes in Computer Science.

[18]  Bengt Jonsson,et al.  Active learning for extended finite state machines , 2016, Formal Aspects of Computing.

[19]  Laurent Bako,et al.  Identification of switched linear systems via sparse optimization , 2011, Autom..

[20]  Daniel Liberzon,et al.  Switching in Systems and Control , 2003, Systems & Control: Foundations & Applications.

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

[22]  Frits W. Vaandrager,et al.  Benchmarks for Automata Learning and Conformance Testing , 2018, Models, Mindsets, Meta.

[23]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[24]  Olivier Gehan,et al.  Convergence analysis of a real-time identification algorithm for switched linear systems with bounded noise , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[25]  Corina S. Pasareanu,et al.  Abstraction and Learning for Infinite-State Compositional Verification , 2013, Festschrift for Dave Schmidt.

[26]  Roland Groz,et al.  hW-inference: A heuristic approach to retrieve models through black box testing , 2020, J. Syst. Softw..

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

[28]  Alberto Bemporad,et al.  Identification of piecewise affine systems via mixed-integer programming , 2004, Autom..

[29]  René Vidal,et al.  Identification of Hybrid Systems: A Tutorial , 2007, Eur. J. Control.

[30]  S. Sastry,et al.  An algebraic geometric approach to the identification of a class of linear hybrid systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[31]  Fabien Lauer.  On the complexity of switching linear regression , 2016, Autom..

[32]  Constantino M. Lagoa,et al.  Set membership identification of switched linear systems with known number of subsystems , 2015, Autom..

[33]  René Vidal,et al.  Recursive identification of switched ARX systems , 2008, Autom..

[34]  A. Garulli,et al.  A survey on switched and piecewise affine system identification , 2012 .

[35]  Laura Balzano,et al.  A Robust Algorithm for Online Switched System Identification , 2018, ArXiv.