2020
DOI: 10.1007/978-3-030-62822-2_8
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic Model Checking with Sentential Decision Diagrams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…While SAT-based methods for model checking have become increasingly popular, doing reachability analysis with decision diagrams is still an important component of many state-of-the-art model checking tools, as can be seen in the Model Checking Contest (MCC) [30,40]. Symbolic reachability analysis with binary decision diagrams (BDDs) and other variants [6,20,27,41] is done by encoding both the initial system state S init and its transition relation R in the diagram. The set of reachable states S is then iteratively computed using the image operation [33], denoted by S.R, starting from S init .…”
Section: Introductionmentioning
confidence: 99%
“…While SAT-based methods for model checking have become increasingly popular, doing reachability analysis with decision diagrams is still an important component of many state-of-the-art model checking tools, as can be seen in the Model Checking Contest (MCC) [30,40]. Symbolic reachability analysis with binary decision diagrams (BDDs) and other variants [6,20,27,41] is done by encoding both the initial system state S init and its transition relation R in the diagram. The set of reachable states S is then iteratively computed using the image operation [33], denoted by S.R, starting from S init .…”
Section: Introductionmentioning
confidence: 99%