The problem of the robust fault detection filter design for time-varying delays switched systems is considered in the framework of mixed H-/H∞. Firstly, the weighted H∞ performance index is utilized as the robustnes...The problem of the robust fault detection filter design for time-varying delays switched systems is considered in the framework of mixed H-/H∞. Firstly, the weighted H∞ performance index is utilized as the robustness performance, and the H- index is used as the sensitivity performance for obtaining the robust fault detection filter. Then a novel multiple Lyapunov-Krasovskii function is proposed for deriving sufficient existence conditions of the robust fault detection filter based on the average dwell time technique. By introducing slack matrix variable, the coupling between the Lyapunov matrix and system matrix is removed, and the conservatism of results is reduced. Based on the robust fault detection filter, residual is generated and evaluated for detecting faults. In addition, the results of this paper are dependent on time delays,and represented in the form of linear matrix inequalities. Finally,the simulation example verifies the effectiveness of the proposed method.展开更多
The In-Parameter-Order （IPO） algorithm is a widely used strategy for the construction of software test suites for combinatorial testing （CT） whose goal is to reveal faults triggered by interactions among parameter...The In-Parameter-Order （IPO） algorithm is a widely used strategy for the construction of software test suites for combinatorial testing （CT） whose goal is to reveal faults triggered by interactions among parameters. Variants of IPO have been shown to produce test suites within reasonable amounts of time that are often not much larger than the smallest test suites known. When an entire test suite is executed, all faults that arise from t-way interactions for some fixed t are surely found. However, when tests are executed one at a time, it is desirable to detect a fault as early as possible so that it can be repaired. The basic IPO strategies of horizontal and vertical growth address test suite size, but not the early detection of faults. In this paper, the growth strategies in IPO are modified to attempt to evenly distribute the values of each parameter across the tests. Together with a reordering strategy that we add, this modification to IPO improves the rate of fault detection dramatically （improved by 31% on average）. Moreover, our modifications always reduce generation time （2 times faster on average） and in some eases also reduce test suite size.展开更多
基金supported by the National Natural Science Foundation of China(6127316261403104)
文摘The problem of the robust fault detection filter design for time-varying delays switched systems is considered in the framework of mixed H-/H∞. Firstly, the weighted H∞ performance index is utilized as the robustness performance, and the H- index is used as the sensitivity performance for obtaining the robust fault detection filter. Then a novel multiple Lyapunov-Krasovskii function is proposed for deriving sufficient existence conditions of the robust fault detection filter based on the average dwell time technique. By introducing slack matrix variable, the coupling between the Lyapunov matrix and system matrix is removed, and the conservatism of results is reduced. Based on the robust fault detection filter, residual is generated and evaluated for detecting faults. In addition, the results of this paper are dependent on time delays,and represented in the form of linear matrix inequalities. Finally,the simulation example verifies the effectiveness of the proposed method.
基金the National Natural Science Foundation of China under Grant Nos. 61300007 and 61305054, the Fundamental Research Funds for the Central Universities of China under Grant Nos. YWF-15-GJSYS-106 and YWF-14-JSJXY-007, and the Project of the State Key Laboratory of Software Development Environment of China under Grant Nos. SKLSDE-2015ZX-09 and SKLSDE-2014ZX-06.
文摘The In-Parameter-Order （IPO） algorithm is a widely used strategy for the construction of software test suites for combinatorial testing （CT） whose goal is to reveal faults triggered by interactions among parameters. Variants of IPO have been shown to produce test suites within reasonable amounts of time that are often not much larger than the smallest test suites known. When an entire test suite is executed, all faults that arise from t-way interactions for some fixed t are surely found. However, when tests are executed one at a time, it is desirable to detect a fault as early as possible so that it can be repaired. The basic IPO strategies of horizontal and vertical growth address test suite size, but not the early detection of faults. In this paper, the growth strategies in IPO are modified to attempt to evenly distribute the values of each parameter across the tests. Together with a reordering strategy that we add, this modification to IPO improves the rate of fault detection dramatically （improved by 31% on average）. Moreover, our modifications always reduce generation time （2 times faster on average） and in some eases also reduce test suite size.
