Sciweavers

293 search results - page 2 / 59
» Advances in Probabilistic Model Checking
Sort
View
FMCAD
2006
Springer
13 years 8 months ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch
MTV
2006
IEEE
138views Hardware» more  MTV 2006»
13 years 11 months ago
Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs
In this paper we will present an optimized structural 01X-SAT-solver for bounded model checking of blackbox designs that exploits semantical knowledge regarding the node selection...
Marc Herbstritt, Bernd Becker, Christoph Scholl
FSTTCS
2010
Springer
13 years 2 months ago
Model Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
LICS
2003
IEEE
13 years 10 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
Marcin Jurdzinski, François Laroussinie, Je...