Approximating response times for static-priority tasks with release jitters

We consider static-priority tasks with constrained-deadlines that are subjected to release jitters. We define an approximate worst-case response time analysis and we propose a polynomial time algorithm. For that purpose, we extend the Fully Polynomial Time Approximation Scheme (FPTAS) presented in [2] to take into account release jit-ters; this feasibility test is then used to define a polyno-mial time algorithm that computes approximate worst-case response times of tasks. Nevertheless, the approximate worst-case response time values have not be proved to have any bounded error in comparison with worst-case response times.