A new algorithm for partitioned symbolic reachability analysis (Q4982091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for partitioned symbolic reachability analysis |
scientific article; zbMATH DE number 6418600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for partitioned symbolic reachability analysis |
scientific article; zbMATH DE number 6418600 |
Statements
A New Algorithm for Partitioned Symbolic Reachability Analysis (English)
0 references
23 March 2015
0 references
binary decision diagrams
0 references
symbolic reachability analysis
0 references
quantitative verification of systems
0 references
0.7943423986434937
0 references
0.7827780842781067
0 references
0.7825860977172852
0 references
0.7648735046386719
0 references
