585 search results - page 35 / 117 » Better Abstractions for Timed Automata |
169
click to vote
SIGSOFT
2007
ACM
16 years 6 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
161
click to vote
BIRTHDAY
2010
Springer
15 years 10 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
109
click to vote
ALIFE
2004
15 years 5 months ago
2004
Toys and play-things are often engineered to replicate the character of real organisms. In the past, inventors often lavished great expense on their life-like automata, their cons...
150
click to vote
FPL
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Layout tools for FPGAs can typically be run in two different modes: non-timing-driven and timing-driven. Non-timing-driven mode produces a solution quickly, without consi...
149
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...