522 search results - page 97 / 105 » Real-time Logics: Complexity and Expressiveness |
157
click to vote
TVLSI
2010
15 years 1 months ago
2010
Hardware debuggers and logic analyzers must be able to record a continuous trace of data. Since the trace data are tremendous, to save space, these traces are often compressed. The...
158
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
184
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
183
click to vote
DBPL
1995
Springer
15 years 10 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
199
click to vote
JBCB
2007
15 years 6 months ago
2007
Mechanistic models for transcriptional regulation are derived using the methods of equilibrium statistical mechanics, to model equilibrating processes that occur at a fast time sc...