41 search results - page 1 / 9 » Symbolic Model Checking without BDDs |
TACAS
1999
Springer
13 years 10 months ago
1999
Springer
DAC
1999
ACM
14 years 6 months ago
1999
ACM
ICFEM
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
MASCOTS
2004
13 years 7 months ago
2004
In this paper, we describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs, which allow a c...
RISE
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...