Sciweavers

244 search results - page 5 / 49
» Counterexamples in Probabilistic Model Checking
Sort
View
CORR
2006
Springer
124views Education» more  CORR 2006»
13 years 7 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...
QEST
2008
IEEE
14 years 1 months ago
Debugging of Dependability Models Using Interactive Visualization of Counterexamples
Abstract—We present an approach to support the debugging of stochastic system models using interactive visualization. The goal of this work is to facilitate the identification o...
Husain Aljazzar, Stefan Leue
FASE
2005
Springer
14 years 1 months ago
A Framework for Counterexample Generation and Exploration
Model-checking is becoming an accepted technique for debugging hardware and software systems. Debugging is based on the “Check / Analyze / Fix” loop: check the system against a...
Marsha Chechik, Arie Gurfinkel
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...
QEST
2008
IEEE
14 years 1 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...