Modeling task systems using parameterized partial orders

EUROSYS
  • 133 Downloads

Abstract

Inspired by work on model-based design of printers, the notion of a parametrized partial order (PPO) has recently been introduced. PPOs are a simple extension of partial orders, expressive enough to compactly represent large task graphs with finite repetitive behavior. We present a translation of a subclass of PPOs to timed automata and prove that the transition system induced by the Uppaal models is isomorphic to the configuration structure of the original PPO. Moreover, we introduce real-time task systems (RTTSs), a general model for real-time embedded systems that we have used to describe the data paths of realistic printer designs. In an RTTS, tasks are represented as PPOs and the pace of a task instance may vary, depending on the resources that are allocated to it. We describe a translation of a subclass of RTTSs to Uppaal, and establish, for an even smaller subclass, bisimulation equivalence between the timed configuration semantics of an RTTS and the transition system induced by the corresponding Uppaal translation. Lastly, we report on a series of experiments which demonstrates that the resulting Uppaal models are more tractable than handcrafted models of the same systems used in earlier case studies.

Keywords

Parameterized partial orders Real-time task systems Task graphs Scheduling Real-time embedded system Design-space exploration 

Notes

Acknowledgments

An extended abstract of this paper appeared as [1]. This research has been carried out as part of the OCTOPUS project under the responsibility of the Embedded Systems Institute. This project is partially supported by the Netherlands Ministry of Economic Affairs under the Bsik program. This research was also supported by European Community’s FP7 Programme under grant agreement no 214755 (QUASIMODO). We thank Twan Basten, Alexandre David, Martijn Hendriks, Nikola Trčka, Marc Voorhoeve, for inspiring discussions on the topic of this paper. We dedicate this paper to the memory of Marc Voorhoeve, 1950–2011, who devised the notion of a PPO.

References

  1. 1.
    Houben, F., Igna, G., Vaandrager, F.: Modeling task systems using parameterized partial orders. In: Di Natale, M. (eds.) Proceedings 18th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2012), Beijing China, April 16–19, 2012, pp. 317–327. IEEE Computer Society, New York (2012)Google Scholar
  2. 2.
    Balarin, F., Chiodo, M., Giusto, P., Hsieh, H., Jurecska, A., Lavagno, L., Passerone, C., Sangiovanni-Vincentelli, A., Sentovich, E., Suzuki, K., Tabbara, B.: Hardware–Software Co-Design of Embedded Systems: The POLIS Approach. Kluwer Academic Press, Dordrecht (1997)MATHCrossRefGoogle Scholar
  3. 3.
    Kienhuis, B., Deprettere, E.F., Vissers, K.A., van der Wolf, P.: An approach for quantitative analysis of application-specific dataflow architectures. In: ASAP, pp. 338–349. IEEE Computer Society, New York (1997)Google Scholar
  4. 4.
    Nieuwelaar, N.V.D., Mortel-Fronczak, J.V.D., Rooda, J.: Design of supervisory machine control. In: European Control Conference (2003)Google Scholar
  5. 5.
    Hendriks, M., van den Nieuwelaar, B., Vaandrager, F.: Recognizing finite repetitive scheduling patterns in manufacturing systems. In MISTA 2003, The University of Nottingham, pp. 291–319 (2003)Google Scholar
  6. 6.
    Mazurkiewicz, A.W.: Compositional semantics of pure place/transition systems. In: European Workshop on Applications and Theory of Petri Nets, ser. Lecture Notes in Computer Science, vol. 340, pp. 307–330. Springer, Berlin (1987)Google Scholar
  7. 7.
    Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Program. 15, 33–71 (1986)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Winskel, G.: An introduction to event structures. In REX Workshop, ser. Lecture Notes in Computer Science, vol. 354, pp. 364–397. Springer, Berlin (1988)Google Scholar
  9. 9.
    Jensen, K., Kristensen, L.M., Wells, L.: Coloured petri nets and cpn tools for modelling and validation of concurrent systems. STTT 9(3–4), 213–254 (2007)CrossRefGoogle Scholar
  10. 10.
    Jensen, K., Kristensen, L.M.: Coloured Petri Nets—Modelling and Validation of Concurrent Systems. Springer, Berlin (2009)CrossRefGoogle Scholar
  11. 11.
    Trčka, N., Voorhoeve, M., Basten, T.: Parameterized partial orders for modeling embedded system use cases: formal definition and translation to coloured petri nets. In: ACSD, pp. 13–18 (2011)Google Scholar
  12. 12.
    Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: SFM, ser. Lecture Notes in Computer Science, vol. 3185. pp. 200–236. Springer, Berlin (2004)Google Scholar
  13. 13.
    Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Abdeddaïm, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: IPDPS. IEEE Computer Society, New York (2003)Google Scholar
  15. 15.
    Mikucionis, M., Larsen, K.G., Rasmussen, J.I., Nielsen, B., Skou, A., Palm, S.U., Pedersen, J.S., Hougaard, P.: Schedulability analysis using uppaal: Herschel-planck case study. In: Margaria, T., Steffen, B. (eds). Leveraging Applications of Formal Methods, Verification, and Validation—4th International Symposium on Leveraging Applications, ISoLA 2010, Heraklion, Crete, Greece, October 18–21, 2010, Proceedings, Part II, ser. Lecture Notes in Computer Science, vol. 6416, pp. 175–190, Springer, Berlin (2010)Google Scholar
  16. 16.
    Hendriks, M., Verhoef, M.: Timed automata based analysis of embedded system architectures. In: IPDPS. IEEE, New York (2006)Google Scholar
  17. 17.
    Perathoner, S., Wandeler, E., Thiele, L., Hamann, A., Schliecker, S., Henia, R., Racu, R., Ernst, R., Harbour, M.G.: Influence of different abstractions on the performance analysis of distributed hard real-time systems. Design Autom. Embed. Syst. 13(1–2), 27–49 (2009)CrossRefGoogle Scholar
  18. 18.
    Berendsen, J., Gebremichael, B., Vaandrager, F.W., Zhang, M.: Formal specification and analysis of zeroconf using uppaal. ACM Trans. Embed. Comput. Syst. 10(3), 34 (2011)CrossRefGoogle Scholar
  19. 19.
    Cassez, F., Jessen, J.J., Larsen, K.G., Raskin, J.-F., Reynier, P.-A.: Automatic synthesis of robust and optimal controllers—an industrial case study. In: HSCC, ser. Lecture Notes in Computer Science, vol. 5469, pp. 90–104. Springer, Berlin (2009)Google Scholar
  20. 20.
    Igna, G., Kannan, V., Yang, Y., Basten, T., Geilen, M., Vaandrager, F.W., Voorhoeve, M., de Smet, S., Somers, L.J.: Formal modeling and scheduling of datapaths of digital document printers. In: FORMATS, ser. Lecture Notes in Computer Science, vol. 5215, pp. 170–187. Springer, Berlin (2008)Google Scholar
  21. 21.
    Igna, G., Vaandrager, F.W.: Verification of printer datapaths using timed automata. In: ISoLA (2), ser. Lecture Notes in Computer Science, vol. 6416, pp. 412–423. Springer, Berlin (2010)Google Scholar
  22. 22.
    AlAttili, I., Houben, F., Igna, G., Michels, S., Zhu, F., Vaandrager, F.W.: Adaptive scheduling of data paths using uppaal tiga. In: QFM, ser. EPTCS, vol. 13, pp. 1–11 (2009)Google Scholar
  23. 23.
    Basten, T., van Benthum, E., Geilen, M., Hendriks, M., Houben, F., Igna, G., Reckers, F., de Smet, S., Somers, L.J., Teeselink, E., Trčka, N., Vaandrager, F., Verriet, J., Voorhoeve, M., Yang, Y.: Model-driven design-space exploration for embedded systems: the octopus toolset. In: ISoLA (1), ser. Lecture Notes in Computer Science, vol. 6415, pp. 90–105. Springer, Berlin (2010)Google Scholar
  24. 24.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973) Google Scholar
  25. 25.
    Mok, A.K., Feng, A.X., Chen, D.: Resource partition for real-time systems. In: IEEE Real Time Technology and Applications Symposium, pp. 75–84. IEEE Computer Society, New York (2001)Google Scholar
  26. 26.
    Chakraborty, S., Künzli, S., Thiele, L.: A general framework for analysing system properties in platform-based embedded system designs. In: DATE, pp. 10190–10195. IEEE Computer Society, New York (2003)Google Scholar
  27. 27.
    Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., Ernst, R.: System level performance analysis—the SymTA/S approach. IEEE Proc. Comput. Digit. Tech. 152(2), 148–166 (2005)CrossRefGoogle Scholar
  28. 28.
    Norström, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: RTCSA, pp. 182–189. IEEE Computer Society, New York (1999)Google Scholar
  29. 29.
    Krcál, P., Stigge, M., Yi, W.: Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times. In: FORMATS, ser. Lecture Notes in Computer Science. vol. 4763, pp. 274–289. Springer, Berlin (2007)Google Scholar
  30. 30.
    Fersman, E., Krcál, P., Pettersson, P., Yi, W.: Task automata: schedulability, decidability and undecidability. Inf. Comput. 205(8), 1149–1172 (2007)MATHCrossRefGoogle Scholar
  31. 31.
    van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and petri nets. CoRR, vol. abs/0912.4023 (2009)Google Scholar
  32. 32.
    Octopus toolset homepage. http://dse.esi.nl (2011)
  33. 33.
    Christensen, S., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: TACAS, ser. Lecture Notes in Computer Science, vol. 2031, pp. 450–464. Springer, Berlin (2001)Google Scholar
  34. 34.
    Peled, D.: Ten years of partial order reduction. In: CAV, ser. Lecture Notes in Computer Science, vol. 1427, pp. 17–28. Springer, Berlin (1998)Google Scholar
  35. 35.
    McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: CAV, ser. Lecture Notes in Computer Science, vol. 663, pp. 164–177. Springer, Berlin (1992)Google Scholar
  36. 36.
    Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: Proceedings of the 29th IEEE Real-Time Systems Symposium, RTSS 2008, Barcelona, Spain, 30 November–3 December 2008, pp. 80–89. IEEE Computer Society, New York (2008)Google Scholar
  37. 37.
    Simalatsar, A., Ramadian, Y., Lampka, K., Perathoner, S., Passerone, R., Thiele, L.: Enabling parametric feasibility analysis in real-time calculus driven performance evaluation. In: Gupta, R.K., Mooney, V.J. (eds.) Proceedings of the 14th International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2011, Part of the Seventh Embedded Systems Week, ESWeek 2011, Taipei, Taiwan, October 9–14, 2011, pp. 155–164. ACM, New York (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.ASMLVeldhovenThe Netherlands
  2. 2.ICIS, MBSD GroupRadboud University NijmegenNijmegenThe Netherlands

Personalised recommendations