Efficient System Verification with Multiple Weakly-Hard Constraints for Runtime Monitoring
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
12399 LNCS
Pages
497-516
Date Issued
2020
Author(s)
Abstract
A weakly-hard fault model can be captured by an (m, k) constraint, where (Formula Presented), meaning that there are at most m bad events (faults) among any k consecutive events. In this paper, we use a weakly-hard fault model to constrain the occurrences of faults in system inputs. We develop approaches to verify properties for all possible values of (m, k), where k is smaller than or equal to a given K, in an exact and efficient manner. By verifying all possible values of (m, k), we define weakly-hard requirements for the system environment and design a runtime monitor based on counting the number of faults in system inputs. If the system environment satisfies the weakly-hard requirements, the satisfaction of desired properties is guaranteed; otherwise, the runtime monitor can notify the system to switch to a safe mode. Experimental results with a discrete second-order controller demonstrate the efficiency of the proposed approaches. © 2020, Springer Nature Switzerland AG.
Subjects
Formal verification; Weakly-hard models
Other Subjects
Computer science; Computers; Hard constraints; Hard faults; Runtime Monitoring; Runtime monitors; Second orders; System environment; System verifications; Artificial intelligence
Type
conference paper