585 search results - page 48 / 117 » Better Abstractions for Timed Automata |
80
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
125
click to vote
FOIKS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
110
Voted
FDL
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract-- Analog and Mixed Signal (AMS) designs are important integrated systems that link digital circuits to the analog world. Following the success of PSL verification methodol...
118
Voted
GLOBECOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...