We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
In recent years there has been an increasing demand to build ”soft” real-time applications on top of asynchronous distributed systems. Designing and implementing such applicat...
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...