34 search results - page 3 / 7 » A Kleene Theorem for Timed Automata |
108
Voted
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
DLT
2009
14 years 8 months ago
2009
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a gi...
81
Voted
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
LATIN
1992
Springer
15 years 2 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
71
Voted
FORMATS
2003
Springer
15 years 3 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...