125 search results - page 1 / 25 » A Logic of Probability with Decidable Model Checking |
LOGCOM
2006
13 years 5 months ago
2006
LFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas ...
FOSSACS
2003
Springer
13 years 10 months ago
2003
Springer
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
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...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...