License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-33627
URL:

; ;

Shrinking Timed Automata

pdf-format:


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.

BibTeX - Entry

@InProceedings{sankur_et_al:LIPIcs:2011:3362,
  author =	{Ocan Sankur and Patricia Bouyer and Nicolas Markey},
  title =	{{Shrinking Timed Automata}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{90--102},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Supratik Chakraborty and Amit Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3362},
  URN =		{urn:nbn:de:0030-drops-33627},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.90},
  annote =	{Keywords: Timed automata, implementability, robustness}
}

Keywords: Timed automata, implementability, robustness
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Issue date: 2011
Date of publication: 2011


DROPS-Home | Fulltext Search | Imprint Published by LZI