Sciweavers

621 search results - page 19 / 125
» Model Checking Probabilistic Distributed Systems
Sort
View
KBSE
2010
IEEE
13 years 6 months ago
A bounded statistical approach for model checking of unbounded until properties
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
Ru He, Paul Jennings, Samik Basu, Arka P. Ghosh, H...
FMCAD
2000
Springer
13 years 11 months ago
Scalable Distributed On-the-Fly Symbolic Model Checking
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
Shoham Ben-David, Tamir Heyman, Orna Grumberg, Ass...
IDEAS
1999
IEEE
166views Database» more  IDEAS 1999»
14 years 1 days ago
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional...
Cory J. Butz, S. K. Michael Wong
ATAL
2005
Springer
14 years 1 months ago
Bounded model checking for knowledge and real time
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
Bozena Wozna, Alessio Lomuscio, Wojciech Penczek
QEST
2010
IEEE
13 years 5 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...