TIMES: a tool for schedulability analysis and code generation of real-time systems

T Amnell, E Fersman, L Mokrushin… - Formal Modeling and …, 2004 - Springer
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 …

Validating timed UML models by simulation and verification

I Ober, S Graf, I Ober - International Journal on Software Tools for …, 2006 - Springer
This paper presents a technique and a tool for model-checking operational (design level)
UML models based on a mapping to a model of communicating extended timed automata …

Formal verification of multitasking applications based on timed automata model

L Waszniowski, Z Hanzálek - Real-Time Systems, 2008 - Springer
The aim of this paper is to show, how a multitasking application running under a real-time
operating system compliant with an OSEK/VDX standard can be modeled by timed …

A real-time profile for UML

S Graf, I Ober, I Ober - International Journal on Software Tools for …, 2006 - Springer
This paper describes an approach for real-time modelling in UML, focusing on analysis and
verification of time and scheduling-related properties. To this aim, a concrete UML profile …

Symbolic computation of schedulability regions using parametric timed automata

A Cimatti, L Palopoli… - 2008 Real-Time Systems …, 2008 - ieeexplore.ieee.org
In this paper, we address the problem of symbolically computing the region in the
parameter's space that guarantees a feasible schedule, given a set of real-time tasks …

Code synthesis for timed automata

T Amnell - 2003 - diva-portal.org
In this thesis, we study executable behaviours of timed models. The focus is on synthesis of
executable code with predictable behaviours from high level abstract models. We assume …

Decidable and undecidable problems in schedulability analysis using timed automata

P Krčál, W Yi - International Conference on Tools and Algorithms for …, 2004 - Springer
We study schedulability problems of timed systems with non-uniformly recurring computation
tasks. Assume a set of real time tasks whose best and worst execution times, and deadlines …

Formal verification of real-time systems with preemptive scheduling

D Lime, O Roux - Real-Time Systems, 2009 - Springer
In this paper, we propose a method for the verification of timed properties for real-time
systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time …

Case study on distributed and fault tolerant system modeling based on timed automata

L Waszniowski, J Krákora, Z Hanzálek - Journal of Systems and Software, 2009 - Elsevier
This article presents the modeling of a distributed fault-tolerant real-time application by timed
automata. The application under consideration consists of several processors …

[PDF][PDF] A generic approach to schedulability analysis of real-time tasks

E Fersman, W Yi - Nordic Journal of Computing, 2004 - Citeseer
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic,
ie they are released with fixed rates. To relax the assumption of complete knowledge on …