Shrinking Timed Automata

Authors Ocan Sankur, Patricia Bouyer, Nicolas Markey

Thumbnail PDF


  • Filesize: 498 kB
  • 13 pages

Document Identifiers

Author Details

Ocan Sankur
Patricia Bouyer
Nicolas Markey

Cite AsGet BibTex

Ocan Sankur, Patricia Bouyer, and Nicolas Markey. Shrinking Timed Automata. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 90-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


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.
  • Timed automata
  • implementability
  • robustness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads