Active Model Learning of Stochastic Reactive Systems

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

[2]  Kim G. Larsen,et al.  L*-Based Learning of Markov Decision Processes (Extended Version) , 2019, ArXiv.

[3]  José Oncina,et al.  Learning deterministic regular grammars from stochastic samples in polynomial time , 1999, RAIRO Theor. Informatics Appl..

[4]  Bernhard K. Aichernig,et al.  AALpy: an active automata learning library , 2022, Innovations in Systems and Software Engineering.

[5]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[6]  Frits W. Vaandrager,et al.  Combining Model Learning and Model Checking to Analyze TCP Implementations , 2016, CAV.

[7]  Francisco Casacuberta,et al.  Machine Translation with Inferred Stochastic Finite-State Transducers , 2004, Computational Linguistics.

[8]  Bengt Jonsson,et al.  Learning of event-recording automata , 2010, Theor. Comput. Sci..

[9]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[10]  Kim G. Larsen,et al.  L*-Based Learning of Markov Decision Processes , 2019, FM.

[11]  Bernhard K. Aichernig,et al.  From Passive to Active: Learning Timed Automata Efficiently , 2020, NFM.

[12]  Bernhard K. Aichernig,et al.  Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning , 2020, TAP@STAF.

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

[14]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[15]  Bernhard K. Aichernig,et al.  Learning Abstracted Non-deterministic Finite State Machines , 2020, ICTSS.

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

[17]  Bernhard Steffen,et al.  The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning , 2014, RV.

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

[19]  José Oncina,et al.  Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.

[20]  Bernhard K. Aichernig,et al.  Probabilistic black-box reachability checking (extended version) , 2017, Formal Methods in System Design.

[21]  Kim G. Larsen,et al.  Learning deterministic probabilistic automata from a model checking perspective , 2016, Machine Learning.