3653 search results - page 179 / 731 » On Recognizable Timed Languages |
199
click to vote
CAV
1994
Springer
15 years 9 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
152
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
131
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
144
Voted
FSEN
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
159
Voted
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...