Advertisement

TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems

  • Tobias Amnell
  • Elena Fersman
  • Leonid Mokrushin
  • Paul Pettersson
  • Wang Yi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2791)

Abstract

Times is a tool suite designed mainly for symbolic schedulability analysis and synthesis of executable code with predictable behaviours for real-time systems. Given a system design model consisting of (1) a set of application tasks whose executions may be required to meet mixed timing, precedence, and resource constraints, (2) a network of timed automata describing the task arrival patterns and (3) a preemptive or non-preemptive scheduling policy, Times will generate a scheduler, and calculate the worst case response times for the tasks. The design model may be further validated using a model checker e.g. UPPAAL and then compiled to executable C-code using the Times compiler. In this paper, we present the design and main features of Times including a summary of theoretical results behind the tool. Times can be downloaded at www.timestool.com.

Keywords

Schedule Policy Precedence Constraint Sporadic Task Schedulability Analysis Executable Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Times - a tool for modelling and implementation of embedded systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 460–464. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Amnell, T., Fersman, E., Pettersson, P., Sun, H., Yi, W.: Code synthesis for timed automata. Nordic Journal of Computing 9(4), 269–300 (2002)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Balarin, F., Lavagno, L., Murthy, P., Sangiovanni-vincentelli, A.: Scheduling for embedded real-time systems. IEEE Design & Test of Computers 15(1), 71–82 (1998)CrossRefGoogle Scholar
  4. 4.
    Buttazzo, G.C.: Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1997)zbMATHGoogle Scholar
  5. 5.
    Ericsson, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: Proceedings of Nordic Workshop on Programming Theory (1998)Google Scholar
  6. 6.
    Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Schedulability analysis using two clocks. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 224–239. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processes: Schedulability and decidability. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 67–82. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Fersman, E., Yi, W.: A generic approach to schedulability analysis of real-time tasks (2003) (submitted for publication)Google Scholar
  9. 9.
    Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer 1(1–2), 134–152 (1997)zbMATHCrossRefGoogle Scholar
  10. 10.
    Rajkumar, R., Sha, L., Lehoczky, J.P.: An experimental investigation of synchronization protocols. In: Proceedings 6th IEEE Workshop on Real-Time Operating Systems and Software, pp. 11–17. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  11. 11.
    Yi, W.: A Calculus of Real Time Systems. PhD thesis, Department of Computer Science, Chalmers University of Technology (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tobias Amnell
    • 1
  • Elena Fersman
    • 1
  • Leonid Mokrushin
    • 1
  • Paul Pettersson
    • 1
  • Wang Yi
    • 1
  1. 1.Department of Information Technology Uppsala UniversityUppsalaSweden

Personalised recommendations