Sciweavers

Share
RTSS
2008
IEEE

Symbolic Computation of Schedulability Regions Using Parametric Timed Automata

9 years 10 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
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 characterised by a set of parameters and by an activation pattern. We make three main contributions. First, we propose a novel and general method, based on parametric timed automata. Second, we prove that the algorithm terminates for the case of periodic processes with bounded offsets. Third, we provide an implementation based on the use of symbolic model checking techniques for parametric timed automata, and present some case studies.
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where RTSS
Authors Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
Comments (0)
books