Sciweavers

438 search results - page 37 / 88
» Efficient Timing Analysis Algorithms for Timed State Space E...
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
13 years 7 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
CONCUR
2001
Springer
14 years 7 days ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
DAC
1994
ACM
13 years 11 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
QUESTA
2008
382views more  QUESTA 2008»
13 years 7 months ago
A note on stable flow-equivalent aggregation in closed networks
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...
Giuliano Casale