1246 search results - page 37 / 250 » Recursive Timed Automata |
109
click to vote
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
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 ...
104
Voted
CONCUR
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
128
click to vote
RTSS
2008
IEEE
15 years 7 months ago
2008
IEEE
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 character...
FORMATS
2003
Springer
15 years 5 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
112
click to vote
FORTE
2007
15 years 2 months ago
2007
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...