Advertisement

TIMES b— A Tool for Modelling and Implementation of Embedded Systems

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

Abstract

Times is a modelling and schedulability analysis tool for embedded real-time systems, developed at Uppsala University in 2001. It is appropriate for systems that can be described as a set of preemptive or non-preemptive tasks which are triggered periodically or sporadically by time or external events. It provides a graphical interface for editing and simulation, and an engine for schedulability analysis. The main features of Times are:
  • A graphical editor for timed automata extended with tasks [1], which allows the user to model a system and the abstract behaviour of its environment In addition the user may specify a set of preemptive or non-preemtive tasks with parameters such as (relative) deadline, execution time, priority, etc.

  • A simulator, in which the user can validate the dynamic behaviour of the system and see how the tasks execute according to the task parameters and a given scheduling policy. The simulator shows a graphical representation of the generated trace showing the time points when the tasks are released, invoked, suspended, resumed, and completed.

  • A verifier for schedulability analysis, which is used to check if all reachable states of the complete system are schedulable that is, all task instances meet their deadlines. A symbolic algorithm has been developed based on the DBM techniques and implemented based on the verifier of the Uppaal tool [2].

  • A code generator for automatic synthesis of C-code on LegoOS platform from the model. If the automata model is schedulable according to the schedulability analyser the execution of the generated code will meet all the timing constraints specified in the model and the tasks.

Keywords

Schedule Policy Real Time Task Task Parameter Schedulability Analysis Reachability Problem 
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.

References

  1. 1.
    Elena Fersman, Paul Pettersson, and Wang Yi. Timed Automata with Asynchronous Processes: Schedulability and Decidability. In Proc. of the 8th Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2002.Google Scholar
  2. 2.
    Kim G. Larsen, Paul Pettersson, and Wang Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1–2):134–152, October 1997.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

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

Personalised recommendations