Skip to main content

Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems

  • Conference paper
  • First Online:
Formal Techniques for Safety-Critical Systems (FTSCS 2013)

Abstract

In this paper, we address the problem of parametric schedulability analysis of distributed real-time systems scheduled by fixed priority. We propose two different approaches to parametric analysis. The first one is a novel analytic technique that extends single-processor sensitivity analysis to the case of distributed systems. The second approach is based on model checking of Parametric Stopwatch Automata (PSA): we generate a PSA model from a high-level description of the system, and then we apply the Inverse Method to obtain all possible behaviours of the system. Both techniques have been implemented in two software tools, and they have been compared with classical holistic analysis on two meaningful test cases. The results show that the analytic method provides results similar to classical holistic analysis in a very efficient way, whereas the PSA approach is slower but covers the entire space of solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that this is a more general form than the strict original definition of PTA [4]; since most problems for PTA are undecidable anyway, this has no practical incidence, and increases the expressiveness of the formalism.

  2. 2.

    Technically, a part might be non-covered in some cases at the border between the good and the bad subspace; this part has a width of at most \(\epsilon \), where \(\epsilon \) is an input of the tool; of course, the smaller \(\epsilon \), the more costly the analysis (see [5, 7]).

  3. 3.

    By zooming in the figure, it looks like in some very small areas, the region produced by RTScan goes over the region produced by Imitator. However, remember that both tools only deal with integer numbers; that small region does not contain any integer point.

References

  1. Abdeddaïm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theoret. Comput. Sci. 354(2), 272–300 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592–601. ACM (1993)

    Google Scholar 

  5. André, É., Fribourg, L.: Behavioral cartography of timed automata. In: Kučera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 76–90. Springer, Heidelberg (2010)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. André, É., Soulat, R.: The Inverse Method. FOCUS Series in Computer Engineering and Information Technology. ISTE/Wiley, London/New York (2013)

    Book  Google Scholar 

  8. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1–2), 3–21 (2008)

    Article  MathSciNet  Google Scholar 

  9. Bini, E.: The design domain of real-time systems. Ph.D. thesis, Scuola Superiore Sant’Anna (2004)

    Google Scholar 

  10. Bini, E., Buttazzo, G.C.: Schedulability analysis of periodic fixed priority systems. IEEE Trans. Comput. 53(11), 1462–1473 (2004)

    Article  Google Scholar 

  11. Bril, R.J., Lukkien, J.J. , Verhaegh, W.F.J.: Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited. In: ECRTS, pp. 269–279. IEEE Computer Society (2007)

    Google Scholar 

  12. Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS, pp. 80–89 (2008)

    Google Scholar 

  13. Davis, R.I., Burns, A., Bril, R.J., Lukkien, J.J.: Controller area network (CAN) schedulability analysis: refuted, revisited and revised. Real-Time Syst. 35, 239–272 (2007)

    Article  Google Scholar 

  14. Fribourg, L., Lesens, D., Moro, P., Soulat, R.: Robustness analysis for scheduling problems using the inverse method. In: TIME, pp. 73–80. IEEE Computer Society Press (2012)

    Google Scholar 

  15. Gonzalez Harbour, M., Gutierrez Garcia, J.J., Palencia Gutierrez, J.C., Drake Moyano, J.M.: Mast: modeling and analysis suite for real time applications. In: ECRTS, pp. 125–134 (2001)

    Google Scholar 

  16. Grupo de Computadores y Tiempo Real, Universidad de Cantabria. MAST: Modeling and analysis suite for real-time applications. http://mast.unican.es/

  17. Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., Ernst, R.: System level performance analysis – the SymTA/S approach. IEE Proc. Comput. Dig. Tech. 152(2), 148–166 (2005)

    Article  Google Scholar 

  18. Le, T.T.H., Palopoli, L., Passerone, R., Ramadian, Y.: Timed-automata based schedulability analysis for distributed firm real-time systems: a case study. Int. J. Softw. Tools Technol. Transfer 15(3), 211–228 (2013)

    Article  Google Scholar 

  19. Palencia, J.C., Gonzalez Harbour, M.: Schedulability analysis for tasks with static and dynamic offsets. In: RTSS, pp. 26–37 (1998)

    Google Scholar 

  20. Richter, K., Ernst, R.: Event model interfaces for heterogeneous system analysis. In: DATE, pp. 506–513. IEEE Computer Society (2002)

    Google Scholar 

  21. Seto, D., Lehoczky, D.P., Sha, L.: Task period selection and schedulability in real-time systems. In: RTSS (1998)

    Google Scholar 

  22. Sun, Y., Soulat, R., Lipari, G., André, É, Fribourg, L.: Parametric schedulability analysis of fixed priority real-time distributed systems. Research report LSV-13-03, Laboratoire Spécification et Vérification, ENS Cachan, France (2013)

    Google Scholar 

  23. Wandeler, E., Thiele, L., Verhoef, M., Lieverse, P.: System architecture evaluation using modular performance analysis: a case study. Int. J. Softw. Tools Technol. Transfer 8(6), 649–667 (2006)

    Article  Google Scholar 

Download references

Acknowledgements

We would like to express our gratitude to Michael González Harbour and Juan M. Rivas, from the Universidad de Cantabria, for their support to installing and using the Mast tool.

The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement No. 246556.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Étienne André .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sun, Y., Soulat, R., Lipari, G., André, É., Fribourg, L. (2014). Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. In: Artho, C., Ölveczky, P. (eds) Formal Techniques for Safety-Critical Systems. FTSCS 2013. Communications in Computer and Information Science, vol 419. Springer, Cham. https://doi.org/10.1007/978-3-319-05416-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05416-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05415-5

  • Online ISBN: 978-3-319-05416-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics