3169 search results - page 29 / 634 » Robust Timed Automata |
125
click to vote
DLOG
2006
15 years 3 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
100
Voted
FMCAD
2006
Springer
15 years 6 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
116
click to vote
FORMATS
2006
Springer
15 years 6 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
103
click to vote
WIA
2004
Springer
15 years 7 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
143
click to vote
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...