System Verification and Runtime Monitoring with Multiple Weakly-Hard Constraints
Authors: 
Yi-Ting Hsieh, Tzu-Tao Chang, Chen-Jun Tsai, Shih-Lun Wu, Ching-Yuan Bai, Kai-Chieh Chang, Chung-Wei Lin, Eunsuk Kang, Chao Huang, Qi ZhuAuthors Info & Claims
Yi-Ting Hsieh, Tzu-Tao Chang, Chen-Jun Tsai, Shih-Lun Wu, Ching-Yuan Bai, Kai-Chieh Chang, Chung-Wei Lin, Eunsuk Kang, Chao Huang, Qi ZhuAuthors Info & ClaimsArticle No.: 21, Pages 1 - 28
Abstract
A weakly-hard fault model can be captured by an (m,k) constraint, where 0≤ m≤ k, meaning that there are at most m bad events (faults) among any k consecutive events. In this article, 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, then the satisfaction of desired properties is guaranteed; otherwise, the runtime monitor can notify the system to switch to a safe mode. This is especially essential for cyber-physical systems that need to provide guarantees with limited resources and the existence of faults. Experimental results with discrete second-order control, network routing, vehicle following, and lane changing demonstrate the generality and the efficiency of the proposed approaches.
References
[1]
L. Ahrendts, S. Quinton, T. Boroske, and R. Ernst. 2018. Verifying weakly-hard real-time properties of traffic streams in switched networks. In Euromicro Conference on Real-Time Systems, Vol. 106. 15:1–15:22.
[2]
G. Bernat, A. Burns, and A. Liamosi. 2001. Weakly hard real-time systems. IEEE Trans. Comput. 50, 4 (2001), 308–321.
[3]
G. Bernat and R. Cayssials. 2001. Guaranteed on-line weakly-hard real-time systems. In IEEE Real-Time Systems Symposium. IEEE, 22–35.
[4]
R. Blind and F. Allgöwer. 2015. Towards networked control systems with guaranteed stability: Using weakly hard real-time constraints to model the loss process. In IEEE Conference on Decision and Control. IEEE, IEEE, 7510–7515.
[5]
H. Choi, H. Kim, and Q. Zhu. 2019. Job-class-level fixed priority scheduling of weakly-hard real-time systems. In IEEE Real-Time Technology and Applications Symposium. IEEE, 241–253.
[6]
H. Choi, H. Kim, and Q. Zhu. 2021. Toward practical weakly hard real-time systems: A job-class-level scheduling approach. IEEE Internet Things J. 8, 8 (2021), 6692–6708.
[7]
P. S. Duggirala and M. Viswanathan. 2015. Analyzing real time linear control systems using software verification. In IEEE Real-Time Systems Symposium. IEEE, IEEE, 216–226.
[8]
G. Frehse, A. Hamann, S. Quinton, and M. Woehrle. 2014. Formal analysis of timing effects on closed-loop properties of control software. In IEEE Real-Time Systems Symposium. IEEE, 53–62.
[9]
G. Frehse, C. Le Guernic, A. Donzé, S. Cotton, R. Ray, O. Lebeltel, R. Ripado, A. Girard, T. Dang, and O. Maler. 2011. SpaceEx: Scalable verification of hybrid systems. In International Conference on Computer-Aided Verification. Springer, Springer, 379–395.
[10]
A. Gujarati, M. Nasri, R. Majumdar, and B. Brandenburg. 2019. From iteration to system failure: Characterizing the FITness of periodic weakly-hard systems. In Euromicro Conference on Real-Time Systems. 9:1–9:23.
[11]
M. Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with \((m,k)\) -firm deadlines. IEEE Trans. Comput. 44, 12 (1995), 1443–1451.
[12]
Z. A. H. Hammadeh, R. Ernst, S. Quinton, R. Henia, and L. Rioux. 2017. Bounding deadline misses in weakly-hard real-time systems with task dependencies. In Design, Automation and Test in Europe Conference. 584–589.
[13]
Z. A. H. Hammadeh, S. Quinton, M. Panunzio, R. Henia, L. Rioux, and R. Ernst. 2017. Budgeting under-specified tasks for weakly-hard real-time systems. In Euromicro Conference on Real-Time Systems, Vol. 76. 17:1–17:22.
[14]
C. Huang, K.-C. Chang, C.-W. Lin, and Q. Zhu. 2020. SAW: A tool for safety analysis of weakly-hard systems. In Computer Aided Verification, Shuvendu K. Lahiri and Chao Wang (Eds.). Springer International Publishing, Cham, 543–555.
[15]
C. Huang, W. Li, and Q. Zhu. 2019. Formal verification of weakly-hard systems. In ACM International Conference on Hybrid Systems: Computation and Control. ACM, 197–207.
[16]
C. Huang, K. Wardega, W. Li, and Q. Zhu. 2019. Exploring weakly-hard paradigm for networked systems. In Workshop on Design Automation for CPS and IoT. 51–59.
[17]
V. Lesi, I. Jovanov, and M. Pajic. 2017. Network scheduling for secure cyber-physical systems. In IEEE Real-Time Systems Symposium. IEEE, 45–55.
[18]
J. Li, Y. Song, and F. Simonot-Lion. 2006. Providing real-time applications with graceful degradation of QoS and fault tolerance according to \((m, k)\) -firm model. IEEE Trans. Industr. Inform. 2, 2 (2006), 112–119.
[19]
H. Liang, Z. Wang, R. Jiao, and Q. Zhu. 2020. Leveraging weakly-hard constraints for improving system fault tolerance with functional and timing guarantees. In IEEE/ACM International Conference on Computer-Aided Design. 1–9.
[20]
H. Liang, Z. Wang, D. Roy, S. Dey, S. Chakraborty, and Q. Zhu. 2019. Security-driven codesign with weakly-hard constraints for real-time embedded systems. In IEEE International Conference on Computer Design. IEEE, 217–226.
[21]
S. Linsenmayer and F. Allgower. 2017. Stabilization of networked control systems with weakly hard real-time dropout description. In IEEE Conference on Decision and Control. IEEE, 4765–4770.
[22]
P. Pazzaglia, C. Mandrioli, M. Maggio, and A. Cervin. 2019. DMAC: Deadline-miss-aware control. In Euromicro Conference on Real-Time Systems. 1:1–1:24.
[23]
S. Quinton and R. Ernst. 2012. Generalized weakly-hard constraints. In International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. Springer, 96–110.
[24]
L. Schenato. 2009. To zero or to hold control inputs with lossy links? IEEE Trans. Automat. Contr. 54, 5 (2009), 1093–1099.
[25]
Y. Sun and M. Di Natale. 2017. Weakly hard schedulability analysis for fixed priority scheduling of periodic real-time tasks. ACM Trans. Embed. Comput. Syst. 16, 5s (2017), 171:1–171:19.
[26]
S.-L. Wu, C.-Y. Bai, K.-C. Chang, Y.-T. Hsieh, C. Huang, C.-W. Lin, E. Kang, and Q. Zhu. 2020. Efficient system verification with multiple weakly-hard constraints for runtime monitoring. In International Conference on Runtime Verification, Jyotirmoy Deshmukh and Dejan Ničković (Eds.). Springer, 497–516.
[27]
W. Xu, Z. A. H. Hammadeh, A. Kröller, R. Ernst, and S. Quinton. 2015. Improved deadline miss models for real-time systems using typical worst-case analysis. In Euromicro Conference on Real-Time Systems. 247–256.
[28]
Q. Zhu, W. Li, H. Kim, Y. Xiang, K. Wardega, Z. Wang, Y. Wang, H. Liang, C. Huang, J. Fan, and H. Choi. 2020. Know the unknowns: Addressing disturbances and uncertainties in autonomous systems. In IEEE/ACM International Conference on Computer-Aided Design.
Index Terms
- System Verification and Runtime Monitoring with Multiple Weakly-Hard Constraints
Recommendations
Efficient System Verification with Multiple Weakly-Hard Constraints for Runtime Monitoring
Runtime VerificationAbstractA weakly-hard fault model can be captured by an (m, k) constraint, where , 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 ...
Formal verification of weakly-hard systems
HSCC '19: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and ControlWeakly-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 ...
Runtime monitoring for safety of intelligent vehicles
DAC '18: Proceedings of the 55th Annual Design Automation ConferenceAdvanced driver-assistance systems (ADAS), autonomous driving, and connectivity have enabled a range of new features, but also made automotive design more complex than ever. Formal verification can be applied to establish functional correctness, but its ...
Comments
Information & Contributors
Information
Published In
July 2023
154 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Published: 13 July 2023
Online AM: 05 June 2023
Accepted: 17 May 2023
Revised: 09 October 2022
Received: 23 March 2022
Published in TCPS Volume 7, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Asian Office of Aerospace Research and Development (AOARD)
- Office of Naval Research Global (ONRG)
- Taiwan Ministry of Education (MOE)
- Taiwan National Science and Technology Council (NSTC)
- US National Science Foundation (NSF)
- Office of Naval Research (ONR)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 235Total Downloads
- Downloads (Last 12 months)130
- Downloads (Last 6 weeks)13
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in