Sampled Semantics of Timed Automata

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 o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Logical methods in computer science Jg. 6, Issue 3; H. 3; S. 14:1
Hauptverfasser: Krcal, Pavel, Abdulla, Parosh Aziz, Yi, Wang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Logical Methods in Computer Science e.V 01.09.2010
Schlagworte:
Applied mathematics
computer science - formal languages and automata theory
f.1.1, f.4.3
MATEMATIK
MATHEMATICS
Teoretisk datalogi
Theoretical computer science
Tillämpad matematik
ISSN:1860-5974, 1860-5974
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-6(3:14)2010