Sciweavers

554 search results - page 12 / 111
» Approximate Probabilistic Model Checking
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Analysis of a gossip protocol in PRISM
Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout dynamically changing networks. We present an analysis of a gossip pro...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
SIGSOFT
2009
ACM
14 years 8 months ago
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
Esteban Pavese, Sebastián Uchitel, Ví...
FORMATS
2006
Springer
13 years 11 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
TVLSI
2008
107views more  TVLSI 2008»
13 years 7 months ago
Novel Probabilistic Combinational Equivalence Checking
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
Shih-Chieh Wu, Chun-Yao Wang, Yung-Chih Chen
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