3169 search results - page 30 / 634 » Robust Timed Automata |
FORMATS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
FORMATS
2004
Springer
14 years 11 days ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
CONCUR
2005
Springer
13 years 10 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...
RTSS
2008
IEEE
14 years 3 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
14 years 1 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...