Abstract
In this paper we present a new abstraction technique for the model-checking of real-time systems with multiple tasks. Our technique enables the automatic and efficient analysis of the schedulability of real-time tasks for both preemptive and non-preemptive scheduling policies. It is based on the spotlight abstraction principle, which is applied to a queue that contains the tasks of the real-time system to be analyzed. This task-queue is partitioned into a so-called ‘spotlight’ and a ‘shade’. Initially the spotlight contains only a small number of tasks which appear at the front of the queue and will be executed in the near future. The initial shade contains the remaining tasks which will be executed only after the spotlight tasks have been processed. On the basis of these assumptions an abstract state space model is generated. In this model the spotlight is considered in detail, whereas the behavior of the shade is almost entirely abstracted away. Such an abstract model is checked iteratively as follows: first the schedulability of the spotlight tasks is analyzed, and the result is saved for later re-use. If this result is still inconclusive, more tasks are brought from the shade into a now “broader” spotlight, with which the model checker can proceed. These steps are repeated until a decisive schedulability result is reached. In this manner we divide the entire model checking problem into smaller sub-problems such that, in the average case, the model checker’s run-time is still acceptably short.
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
Abdeddaïm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 113–126. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46002-0_9
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: TIMES: a tool for schedulability analysis and code generation of real-time systems. In: Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, 6–7 September 2003. Revised Papers, pp. 60–72 (2003)
André, É., Fribourg, L., Kühne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33–36. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32759-9_6
Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, USA, 20–22 June 2001, pp. 203–213 (2001)
Bauer, K., Gentilini, R., Schneider, K.: A uniform approach to three-valued semantics for \(\mu \)-calculus on abstractions of hybrid automata. Int. J. Softw. Tools Technol. Transf. 13(3), 273–287 (2011)
Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27755-2_3
Bertout, A., Forget, J., Olejnik, R.: Minimizing a real-time task set through task clustering. In: Jan, M., Hedia, B.B., Goossens, J., Maiza, C. (eds.) 22nd International Conference on Real-Time Networks and Systems, RTNS 2014, Versaille, France, 8–10 October 2014, p. 23. ACM (2014)
Bini, E., Natale, M.D., Buttazzo, G.C.: Sensitivity analysis for fixed-priority real-time systems. Real-Time Syst. 39(1–3), 5–30 (2008)
Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Ouaknine, J., Worrell, J.: Model checking real-time systems. In: Handbook of Model Checking, pp. 1001–1046 (2018)
Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processes: schedulability and decidability. In: Katoen, J., Stevens, P. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, TACAS 2002, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, 8–12 April 2002, Proceedings. Lecture Notes in Computer Science, vol. 2280, pp. 67–82. Springer (2002)
Fitting, M.: Kleene’s three valued logics and their children. Fundam. Inform. 20(1/2/3), 113–131 (1994)
Govind, R., Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Revisiting local time semantics for networks of timed automata. In: Fokkink, W.J., van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory, CONCUR 2019, 27–30 August 2019, Amsterdam, the Netherlands. LIPIcs, vol. 140, pp. 16:1–16:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
Grumberg, O.: 2-valued and 3-valued abstraction-refinement in model checking. In: Logics and Languages for Reliability and Security, pp. 105–128 (2010)
Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57(1), 94–124 (1998)
Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Inf. Comput. 251, 67–90 (2016)
Huang, C., Li, Y., Yao, X.: A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans. Evolut. Comput. 24(2), 201–216 (2019)
Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov Chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 311–324. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73368-3_37
Roussanaly, V., Sankur, O., Markey, N.: Abstraction refinement algorithms for timed automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 22–40. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25540-4_2
Schrieb, J., Wehrheim, H., Wonisch, D.: Three-valued spotlight abstractions. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 106–122. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-05089-3_8
Stallings, W.: Operating Systems - Internals and Design Principles, 7th edn, Pitman (2011)
Timm, N., Gruner, S.: Three-valued bounded model checking with cause-guided abstraction refinement. Sci. Comput. Program. 175, 37–62 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Nxumalo, M., Timm, N., Gruner, S. (2021). Spotlight Abstraction in Model Checking Real-Time Task Schedulability. In: Laarman, A., Sokolova, A. (eds) Model Checking Software. SPIN 2021. Lecture Notes in Computer Science(), vol 12864. Springer, Cham. https://doi.org/10.1007/978-3-030-84629-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-84629-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-84628-2
Online ISBN: 978-3-030-84629-9
eBook Packages: Computer ScienceComputer Science (R0)