585 search results - page 18 / 117 » Better Abstractions for Timed Automata |
115
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
92
Voted
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
ACRI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Realistic simulation of biological evolution by necessity requires simplification and reduction in the dimensionality of the corresponding dynamic system. Even when this...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract-- In this paper we extend the work on dynamic observers for fault diagnosis [1], [2], [3] to timed automata. We study sensor minimization problems with static observers an...
DATESO
2010
14 years 7 months ago
2010
Abstract. Real-time database management systems (RTDBMS) are recently subject of an intensive research. Model checking algorithms and verification tools are of great concern as wel...