Sciweavers

41 search results - page 5 / 9
» Symbolic Model Checking without BDDs
Sort
View
FMCAD
2004
Springer
14 years 1 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
CAV
2010
Springer
282views Hardware» more  CAV 2010»
13 years 11 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 1 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
APN
2010
Springer
14 years 1 hour ago
AlPiNA: A Symbolic Model Checker
AlPiNA is a symbolic model checker for High Level Petri nets. It is comprised of two independent modules: a GUI plugin for Eclipse and an underlying model checking engine. AlPiNA...
Didier Buchs, Steve Hostettler, Alexis Marechal, M...
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
14 years 1 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere