Sciweavers

353 search results - page 26 / 71
» From graph states to two-graph states
Sort
View
CODES
2010
IEEE
13 years 6 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
TASE
2007
IEEE
14 years 2 months ago
Symmetry Reduced Model Checking for B
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (or...
Edd Turner, Michael Leuschel, Corinna Spermann, Mi...
ENTCS
2008
95views more  ENTCS 2008»
13 years 8 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
IPSN
2009
Springer
14 years 2 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...
ICFEM
2009
Springer
14 years 16 days ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid