3169 search results - page 2 / 634 » Robust Timed Automata |
FMSD
2008
13 years 5 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
ICIAP
1999
ACM
13 years 10 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
SERA
2007
Springer
13 years 12 months ago
2007
Springer
Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We...
TIME
2007
IEEE
14 years 2 days ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
FM
2005
Springer
13 years 11 months ago
2005
Springer
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...