Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-07-16
LMCS 6 (3:14) 2010
Computer Science
Formal Languages and Automata Theory
Scientific paper
10.2168/LMCS-6(3:14)2010
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.
Abdulla Parosh Aziz
Krcal Pavel
Yi Wang
No associations
LandOfFree
Sampled Semantics of Timed Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sampled Semantics of Timed Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampled Semantics of Timed Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-51181