Integration of Learning-Based Testing and Supervisory Control for Requirements Conformance of Black-Box Reactive Systems

被引:63
作者
Zhang, Huimin [1 ,2 ]
Feng, Lei [3 ]
Wu, Naiqi [4 ]
Li, Zhiwu
机构
[1] Xidian Univ, Sch Electromech Engn, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Minist Educ, Key Lab Elect Equipment & Struct Design, Xian 710071, Shaanxi, Peoples R China
[3] KTH Royal Inst Technol, Dept Machine Design, S-10044 Stockholm, Sweden
[4] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China
基金
中国国家自然科学基金;
关键词
Automata learning; black-box reactive system; learning-based testing (LBT); supervisory control theory (SCT); MACHINES; QUERIES;
D O I
10.1109/TASE.2017.2693995
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A fundamental requirement of the supervisory control theory (SCT) of discrete-event systems is a finite automaton model of the plant. The requirement does not hold for black-box systems whose source code and logical model are not accessible. To apply SCT to black-box systems, we integrate automaton learning technology with SCT and apply the new method to improve the requirements conformance of software reuse. If the reused software component does not satisfy a requirement, the method adds a supervisor component to prevent the black-box system from reaching "faulty sections." The method employs learning-based testing (LBT) to verify whether the reused software meets all requirements in the new context. LBT generates a large number of test cases and iteratively constructs an automaton model of the system under test. If the system fails the test, the learned model is applied as the plant model for control synthesis using SCT. Then, the supervisor is implemented as an executable program to monitor and control the system to follow the requirement. Finally, the integrated system, including the supervisory program and the reused component, is tested by LBT to assure the satisfiability of the requirement. This paper makes two contributions. First, we innovatively integrate LBT and SCT for the control synthesis of black-box reactive systems. Second, software component reuse is still possible even if it does not satisfy user requirements at the outset. Note to Practitioners-In black-box software reuse, if a component does not satisfy user requirements in a new context, the developer has to abandon it and develop a new one, which is costly. The proposed method enables software reuse for black-box reactive systems by combining learning-based testing (LBT) and supervisory control theory (SCT). LBT can test whether the requirements hold in new settings and infer hypothesis models of the component at the same time. If the component does not pass the test, the learned hypothesis is used as a plant model to compute a supervisor using SCT. Then, a supervisory program is developed according to the control actions of the supervisor to govern the system to follow the behavior of the requirements. We illustrate the proposed method through an example of a simple cruise control module. The effectiveness of the new method is demonstrated with a larger software component brake-by-wire with floating point data types. The case studies show not only the methodology of the new approach but also a working tool chain to perform it.
引用
收藏
页码:2 / 15
页数:14
相关论文
共 59 条
[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]  
Akesson K., 2003, P 11 MED C CONTR AUT, P1
[3]   A NOTE ON THE NUMBER OF QUERIES NEEDED TO IDENTIFY REGULAR LANGUAGES [J].
ANGLUIN, D .
INFORMATION AND CONTROL, 1981, 51 (01) :76-87
[4]   LEARNING REGULAR SETS FROM QUERIES AND COUNTEREXAMPLES [J].
ANGLUIN, D .
INFORMATION AND COMPUTATION, 1987, 75 (02) :87-106
[5]  
[Anonymous], 1992, S MACH PERC
[6]  
[Anonymous], 2003, THESIS
[7]  
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[8]  
Berg T., 2006, P 9 INT C FUND APPR, P27
[9]  
Berg T, 2008, LECT NOTES COMPUT SC, V4961, P317, DOI 10.1007/978-3-540-78743-3_24
[10]   SYNTHESIS OF FINITE-STATE MACHINES FROM SAMPLES OF THEIR BEHAVIOR [J].
BIERMANN, AW ;
FELDMAN, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (06) :592-&