Abstract
A weakly-hard fault model can be captured by an (m, k) constraint, where \(0\le m\le k\), 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.
This work is supported by the Asian Office of Aerospace Research and Development (AOARD), jointly with the Office of Naval Research Global (ONRG), award FA2386-19-1-4037, the Taiwan Ministry of Education (MOE) grants NTU-108V0901 and NTU-107V0901, the Taiwan Ministry of Science and Technology (MOST) grants MOST-109-2636-E-002-022 and MOST-108-2636-E-002-011. It is also supported by the National Science Foundation (NSF) awards CCF-1918140, CNS-1834701, CNS-1801546, and the Office of Naval Research (ONR) grant N00014-19-1-2496.
Shih-Lun Wu and Ching-Yuan Bai contributed equally.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ahrendts, L., Quinton, S., Boroske, T., Ernst, R.: Verifying weakly-hard real-time properties of traffic streams in switched networks. In: Euromicro Conference on Real-Time Systems, vol. 106, pp. 15:1–15:22 (2018)
Bernat, G., Burns, A., Liamosi, A.: Weakly hard real-time systems. IEEE Trans. Comput. 50(4), 308–321 (2001)
Bernat, G., Cayssials, R.: Guaranteed on-line weakly-hard real-time systems. In: IEEE Real-Time Systems Symposium, pp. 22–35 (2001)
Blind, R., Allgöwer, F.: 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, pp. 7510–7515. IEEE (2015)
Choi, H., Kim, H., Zhu, Q.: Job-class-level fixed priority scheduling of weakly-hard real-time systems. In: IEEE Real-Time Technology and Applications Symposium, pp. 241–253 (2019)
Duggirala, P.S., Viswanathan, M.: Analyzing real time linear control systems using software verification. In: IEEE Real-Time Systems Symposium, pp. 216–226. IEEE (2015)
Frehse, G., Hamann, A., Quinton, S., Woehrle, M.: Formal analysis of timing effects on closed-loop properties of control software. In: IEEE Real-Time Systems Symposium, pp. 53–62 (2014)
Frehse, G., et al.: SpaceEx: scalable verification of hybrid systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379–395. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22110-1_30
Gujarati, A., Nasri, M., Majumdar, R., Brandenburg, B.B.: From iteration to system failure: characterizing the fitness of periodic weakly-hard systems. In: Euromicro Conference on Real-Time Systems, pp. 9:1–9:23 (2019)
Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with \((m, k)\)-firm deadlines. IEEE Trans. Comput. 44(12), 1443–1451 (1995)
Hammadeh, Z.A.H., Ernst, R., Quinton, S., Henia, R., Rioux, L.: Bounding deadline misses in weakly-hard real-time systems with task dependencies. In: Design, Automation and Test in Europe Conference, pp. 584–589 (2017)
Hammadeh, Z.A.H., Quinton, S., Panunzio, M., Henia, R., Rioux, L., Ernst, R.: Budgeting under-specified tasks for weakly-hard real-time systems. In: Euromicro Conference on Real-Time Systems, vol. 76, pp. 17:1–17:22 (2017)
Huang, C., Chang, K.-C., Lin, C.-W., Zhu, Q.: SAW: a tool for safety analysis of weakly-hard systems. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 543–555. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53288-8_26
Huang, C., Li, W., Zhu, Q.: Formal verification of weakly-hard systems. In: ACM International Conference on Hybrid Systems: Computation and Control, pp. 197–207 (2019)
Huang, C., Wardega, K., Li, W., Zhu, Q.: Exploring weakly-hard paradigm for networked systems. In: Workshop on Design Automation for CPS and IoT, pp. 51–59 (2019)
Lesi, V., Jovanov, I., Pajic, M.: Network scheduling for secure cyber-physical systems. In: IEEE Real-Time Systems Symposium, pp. 45–55 (2017)
Li, J., Song, Y., Simonot-Lion, F.: Providing real-time applications with graceful degradation of QoS and fault tolerance according to \((m, k)\)-firm model. IEEE Trans. Ind. Inf. 2(2), 112–119 (2006)
Liang, H., Wang, Z., Roy, D., Dey, S., Chakraborty, S., Zhu, Q.: Security-driven codesign with weakly-hard constraints for real-time embedded systems. In: 2019 IEEE 37th International Conference on Computer Design (ICCD), pp. 217–226 (2019)
Linsenmayer, S., Allgower, F.: Stabilization of networked control systems with weakly hard real-time dropout description. In: IEEE Conference on Decision and Control, pp. 4765–4770 (2017)
Pazzaglia, P., Mandrioli, C., Maggio, M., Cervin, A.: DMAC: deadline-miss-aware control. In: Euromicro Conference on Real-Time Systems, pp. 1:1–1:24 (2019)
Quinton, S., Ernst, R.: Generalized weakly-hard constraints. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7610, pp. 96–110. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34032-1_13
Schenato, L.: To zero or to hold control inputs with lossy links? IEEE Trans. Autom. Control 54(5), 1093–1099 (2009)
Sun, Y., Natale, M.D.: Weakly hard schedulability analysis for fixed priority scheduling of periodic real-time tasks. ACM Trans. Embed. Comput. Syst. 16(5s), 171:1–171:19 (2017)
Xu, W., Hammadeh, Z.A.H., Kröller, A., Ernst, R., Quinton, S.: Improved deadline miss models for real-time systems using typical worst-case analysis. In: Euromicro Conference on Real-Time Systems, pp. 247–256 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wu, SL. et al. (2020). Efficient System Verification with Multiple Weakly-Hard Constraints for Runtime Monitoring. In: Deshmukh, J., Ničković, D. (eds) Runtime Verification. RV 2020. Lecture Notes in Computer Science(), vol 12399. Springer, Cham. https://doi.org/10.1007/978-3-030-60508-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-60508-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60507-0
Online ISBN: 978-3-030-60508-7
eBook Packages: Computer ScienceComputer Science (R0)