Shrinking Timed Automata

Sankur, Ocan; Bouyer, Patricia; Markey, Nicolas

doi:10.4230/LIPIcs.FSTTCS.2011.90

Document

Shrinking Timed Automata

Authors Ocan Sankur, Patricia Bouyer, Nicolas Markey

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-12-01

PDF

File

PDF

LIPIcs.FSTTCS.2011.90.pdf

Filesize: 498 kB
13 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2011.90
URN: urn:nbn:de:0030-drops-33627

Subject Classification

Keywords

Timed automata
implementability
robustness

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.FSTTCS.2011.90

Author Details

Ocan Sankur

Patricia Bouyer

Nicolas Markey

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail