Sciweavers

621 search results - page 27 / 125
» Model Checking Probabilistic Distributed Systems
Sort
View
TAICPART
2006
IEEE
131views Education» more  TAICPART 2006»
14 years 1 months ago
Bogor: A Flexible Framework for Creating Software Model Checkers
Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. With the proliferation of multicore arch...
Robby, Matthew B. Dwyer, John Hatcliff
SPIN
2010
Springer
13 years 6 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
NIPS
2001
13 years 9 months ago
Model Based Population Tracking and Automatic Detection of Distribution Changes
Probabilistic mixture models are used for a broad range of data analysis tasks such as clustering, classification, predictive modeling, etc. Due to their inherent probabilistic na...
Igor V. Cadez, Paul S. Bradley
FORMATS
2007
Springer
14 years 1 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko