2905 search results - page 212 / 581 » Formal Memetic Algorithms |
204
click to vote
WDAG
2005
Springer
16 years 29 days ago
2005
Springer
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...
176
Voted
CAV
2004
Springer
16 years 27 days ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
175
Voted
FATES
2004
Springer
16 years 26 days ago
2004
Springer
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
206
click to vote
CAV
2003
Springer
16 years 22 days ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
178
click to vote
APN
2001
Springer
16 years 3 hour ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...