FMSD
2008
13 years 4 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...
FMSD
2008
13 years 4 months ago
2008
FMSD
2008
13 years 4 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
FMSD
2008
13 years 4 months ago
2008
FMSD
2008
13 years 4 months ago
2008
FMSD
2008
13 years 4 months ago
2008
FMSD
2008
13 years 4 months 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...