92 search results - page 2 / 19 » Probabilistic Proof Systems - A Survey |
183
Voted
ATVA
2009
Springer
16 years 1 months 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...
177
click to vote
LPAR
2005
Springer
16 years 15 days 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 ...
179
click to vote
VOSS
2004
Springer
16 years 10 days 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...
159
click to vote
TAMC
2010
Springer
16 years 2 days 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
15 years 7 months ago
2008