Sciweavers

571 search results - page 95 / 115
» Performing causality analysis by bounded model checking
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 4 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ROBOCOMM
2007
IEEE
15 years 6 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
LCTRTS
2004
Springer
15 years 5 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
IDEAL
2004
Springer
15 years 5 months ago
Exploiting Safety Constraints in Fuzzy Self-organising Maps for Safety Critical Applications
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
Zeshan Kurd, Tim P. Kelly, Jim Austin
JVM
2001
97views Education» more  JVM 2001»
15 years 1 months ago
Deterministic Execution of Java's Primitive Bytecode Operations
For the application of Java in realtime and safety critical domains, an analysis of the worst-case execution times of primitive Java operations is necessary. All primitive operati...
Fridtjof Siebert, Andy Walter