A Passive Online Technique for Learning Hybrid Automata from Input/Output Traces

被引:5
作者
Saberi, Iman [1 ,3 ]
Faghih, Fathiyeh [1 ,3 ]
Bavil, Farzad Sobhi [2 ]
机构
[1] Univ Tehran, Dept Elect & Comp Engn, Tehran, Iran
[2] Crouse Co, Dept Elect Res & Innovat, 11th KM Karaj Makhsoos Rd, Tehran, Iran
[3] Univ Tehran, Coll Engn, North Kargar St, Tehran, Iran
关键词
Automata learning; passive learning; hybrid automata; learning hybrid automata; TEMPORAL LOGIC; IDENTIFICATION;
D O I
10.1145/3556543
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Specification synthesis is the process of deriving a model from the input-output traces of a system. It is used extensively in test design, reverse engineering, and system identification. One type of the resulting artifact of this process for cyber-physical systems is hybrid automata. They are intuitive, precise, tool independent, and at a high level of abstraction, and can model systems with both discrete and continuous variables. In this article, we propose a new technique for synthesizing hybrid automaton from the input-output traces of a nonlinear cyber-physical system. Similarity detection in non-linear behaviors is the main challenge for extracting such models. We address this problem by utilizing the Dynamic Time Warping technique. Our approach is passive, meaning that it does not need interaction with the system during automata synthesis from the logged traces; and online, which means that each input/output trace is used only once in the procedure. In other words, each new trace can be used to improve the already synthesized automaton. We evaluated our algorithm in one industrial and two simulated case studies. The accuracy of the derived automata shows promising results.
引用
收藏
页数:24
相关论文
共 29 条
[1]   Generating models of infinite-state communication protocols using regular inference with abstraction [J].
Aarts, Fides ;
Jonsson, Bengt ;
Uijen, Johan ;
Vaandrager, Frits .
FORMAL METHODS IN SYSTEM DESIGN, 2015, 46 (01) :1-41
[2]  
Bellman Richard, 1959, P IRE, V4, P1, DOI 10.1109/TAC.1959.1104847
[3]  
Blai S., 2020, 2020 IEEE INT C FUZZ, P1
[4]  
Choi W, 2013, ACM SIGPLAN NOTICES, V48, P623, DOI [10.1145/2544173.2509552, 10.1145/2509136.2509552]
[5]  
Choi Wontae, 2013, P ACM WORKSHOP MOBIL, P27
[6]   Learning Workflow Petri Nets [J].
Esparza, Javier ;
Leucker, Martin ;
Schlund, Maximilian .
FUNDAMENTA INFORMATICAE, 2011, 113 (3-4) :205-228
[7]   Combining Model Learning and Model Checking to Analyze TCP Implementations [J].
Fiterau-Brostean, Paul ;
Janssen, Ramon ;
Vaandrager, Frits .
COMPUTER AIDED VERIFICATION: 28TH INTERNATIONAL CONFERENCE, CAV 2016, PT II, 2016, 9780 :454-471
[8]   COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA [J].
GOLD, EM .
INFORMATION AND CONTROL, 1978, 37 (03) :302-320
[9]  
Henzinger TA, 2000, NATO ADV SCI I F-COM, V170, P265
[10]   Active Automata Learning in Practice An Annotated Bibliography of the Years 2011 to 2016 [J].
Howar, Falk ;
Steffen, Bernhard .
MACHINE LEARNING FOR DYNAMIC SOFTWARE ANALYSIS: POTENTIALS AND LIMITS, 2018, 11026 :123-148