Krcal, Pavel and Abdulla, Parosh Aziz and Yi, Wang - Sampled Semantics of Timed Automata

lmcs:868 - Logical Methods in Computer Science, September 1, 2010, Volume 6, Issue 3
Sampled Semantics of Timed Automata

Authors: Krcal, Pavel and Abdulla, Parosh Aziz and Yi, Wang

Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study one aspect of the relation between these two semantics, namely checking whether the system exhibits some qualitative (untimed) behaviors in the dense time which cannot be reproduced by any implementation with a fixed sampling rate. More formally, the \emph{sampling problem} is to decide whether there is a sampling rate such that all qualitative behaviors (the untimed language) accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics. We show that this problem is decidable.


Source : oai:arXiv.org:1007.2783
DOI : 10.2168/LMCS-6(3:14)2010
Volume: Volume 6, Issue 3
Published on: September 1, 2010
Submitted on: May 10, 2009
Keywords: Computer Science - Formal Languages and Automata Theory,F.1.1, F.4.3


Share

Consultation statistics

This page has been seen 44 times.
This article's PDF has been downloaded 18 times.