41 search results - page 1 / 9 » Symbolic Model Checking without BDDs |
109
Voted
TACAS
1999
Springer
15 years 8 months ago
1999
Springer
96
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
143
Voted
ICFEM
2010
Springer
15 years 2 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...
148
Voted
MASCOTS
2004
15 years 5 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...
134
Voted
RISE
2004
Springer
15 years 9 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...