Sciweavers

2905 search results - page 212 / 581
» Formal Memetic Algorithms
Sort
View
WDAG
2005
Springer
92views Algorithms» more  WDAG 2005»
14 years 4 months ago
Plausible Clocks with Bounded Inaccuracy
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...
Brad T. Moore, Paolo A. G. Sivilotti
CAV
2004
Springer
87views Hardware» more  CAV 2004»
14 years 4 months ago
GSTE Is Partitioned Model Checking
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 ...
Roberto Sebastiani, Eli Singerman, Stefano Tonetta...
FATES
2004
Springer
14 years 4 months ago
Online Testing of Real-time Systems Using Uppaal
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 ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 4 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
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...
Jan Obdrzálek
APN
2001
Springer
14 years 3 months ago
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
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...
Marko Mäkelä