34 search results - page 1 / 7 » A Kleene Theorem for Timed Automata |
81
Voted
LICS
1997
IEEE
15 years 2 months ago
1997
IEEE
88
Voted
HYBRID
1998
Springer
15 years 2 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
JACM
2002
14 years 10 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
68
Voted
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
123
Voted
CIE
2007
Springer
15 years 2 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...