92 search results - page 2 / 19 » Probabilistic Proof Systems - A Survey |
ATVA
2009
Springer
14 years 29 days ago
2009
Springer
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
LPAR
2005
Springer
13 years 12 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
VOSS
2004
Springer
13 years 11 months ago
2004
Springer
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
TAMC
2010
Springer
13 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
FTTCS
2008
13 years 6 months ago
2008