585 search results - page 34 / 117 » Better Abstractions for Timed Automata |
112
Voted
IEEEICCI
2008
IEEE
15 years 6 months ago
2008
IEEE
—A new abstract model of computation, the computational manifold, provides a framework for approaching the problems of consciousness, awareness, cognition and symbolic processing...
133
Voted
IPL
2008
15 years 14 days ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
119
Voted
HYBRID
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
102
Voted
RTAS
2005
IEEE
15 years 6 months ago
2005
IEEE
— Denial-of-service attacks are becoming more frequent and sophisticated. Researchers have proposed a variety of defenses, including better system configurations, infrastructure...
106
Voted
DNA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of ...