5448 search results - page 178 / 1090 » Breakpoints and Time in Distributed Computations |
137
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
124
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
224
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
129
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
143
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...