921 search results - page 13 / 185 » On Interleaving in Timed Automata |
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper considers the environment of interleaved, multi-channel measurements as arises for example in time-interleaved A/D converters and in distributed sensor networks. Such s...
106
Voted
ICTAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
111
Voted
RTSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
107
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
114
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...