par Sankur, Ocan 
;Bouyer, Patricia P.;Markey, Nicolas N.
Référence Information and computation, 234, page (107-132)
Publication Publié, 2014-02
;Bouyer, Patricia P.;Markey, Nicolas N.Référence Information and computation, 234, page (107-132)
Publication Publié, 2014-02
Article révisé par les pairs
| Résumé : | We define and study a new approach to the implementability of timed automata, where the semantics is perturbed by imprecisions and finite frequency of the hardware. In order to circumvent these effects, we introduce parametric shrinking of clock constraints, which corresponds to tightening these. We propose symbolic procedures to decide the existence of (and then compute) parameters under which the shrunk version of a given timed automaton is non-blocking and can time-abstract simulate the exact semantics. We then define an implementation semantics for timed automata with a digital clock and positive reaction times, and show that for shrinkable timed automata, non-blockingness and time-abstract simulation are preserved in implementation. © 2014 Elsevier Inc. |
