Computing under-approximations of multivalued decision diagrams

DOI10.1007/978-3-031-33620-1_14MaRDI QIDQ6535193zbMATH OpenFDO

Authors Seyedehzahra Hosseini, Gianfranco Ciardo

Publication date 16 November 2023

Full work available at URL https://doi.org/10.1007/978-3-031-33620-1_14

zbMATH Keywords

decision diagramsmemory constraintsunder-approximation

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1423226
• On application of multi-rooted binary decision diagrams to probabilistic model checking
• Efficient manipulation of decision diagrams
• Binary decision diagrams
• scientific article; zbMATH DE number 1863167

Cites work

• A fast algorithm for finding dominators in a flowgraph
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete

Cited in

(2)

• scientific article; zbMATH DE number 6930340 (Why is no real title available?)
• scientific article; zbMATH DE number 6292613 (Why is no real title available?)

This page was built for publication: Computing under-approximations of multivalued decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535193)