@inproceedings{992c4b9479aa4c278a1b70ab0522a8d2,
title = "Formal verification of weakly-hard systems",
abstract = "Weakly-hard systems are real-time systems that can tolerate occasional deadline misses in a bounded manner. Compared with traditional systems with hard deadline constraints, they provide more scheduling flexibility, and thus expand the design space for system configuration and reconfiguration. A key question for such a system is precisely to what degree it can tolerate deadline misses while still meeting its functional requirements. In this paper, we provide a formal treatment to the verification problem of a general class of weakly-hard systems. We discuss relaxation and over-approximation techniques for managing the complexity of reachability analysis, and develop algorithms based upon these for verifying the safety of weakly-hard systems. Experiments demonstrate the effectiveness of our approach in understanding the impact of and guiding the selection among different weakly-hard constraints.",
keywords = "Formal verification, Safety, Weakly-hard",
author = "Chao Huang and Wenchao Li and Qi Zhu",
year = "2019",
month = apr,
day = "16",
doi = "10.1145/3302504.3311811",
language = "English (US)",
series = "HSCC 2019 - Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control",
publisher = "Association for Computing Machinery, Inc",
pages = "197--207",
booktitle = "HSCC 2019 - Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems",
note = "22nd ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2019 ; Conference date: 16-04-2019 Through 18-04-2019",
}