Sciweavers

554 search results - page 4 / 111
» Approximate Probabilistic Model Checking
Sort
View
UAI
1998
13 years 8 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
IPL
2007
125views more  IPL 2007»
13 years 7 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
LMCS
2006
87views more  LMCS 2006»
13 years 7 months ago
Model Checking Probabilistic Pushdown Automata
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
Antonín Kucera, Javier Esparza, Richard May...
QEST
2007
IEEE
14 years 1 months ago
Probabilistic Model Checking Modulo Theories
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
Björn Wachter, Lijun Zhang, Holger Hermanns
QEST
2009
IEEE
14 years 2 months ago
Language-Level Symmetry Reduction for Probabilistic Model Checking
—Symmetry reduction is a technique for combating state-space explosion in model checking. The generic representatives approach to symmetry reduction uses a language-level transla...
Alastair F. Donaldson, Alice Miller, David Parker