7 search results - page 2 / 2 » fmsd 2008 |
78
Voted
FMSD
2008
15 years 11 days 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...
98
Voted
FMSD
2008
15 years 11 days ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...