402 search results - page 1 / 81 » Probability, Parallelism and the State Space Exploration Pro... |
CPE
1998
Springer
13 years 9 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
PE
2000
Springer
13 years 4 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
IRREGULAR
1997
Springer
13 years 9 months ago
1997
Springer
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and comm...
CONCUR
2001
Springer
13 years 9 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
ENTCS
2008
13 years 5 months ago
2008
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...