BDD-Based Symbolic Model Checking (Q3176366)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	BDD-Based Symbolic Model Checking	scientific article

Statements

scholarly article

0 references

BDD-Based Symbolic Model Checking (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-10575-8_8

0 references

0 references

0 references

Handbook of Model Checking

0 references

publication date

20 July 2018

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-10575-8_8

0 references

0 references

Binary Decision Diagrams

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

Symbolic model checking: \(10^{20}\) states and beyond

0 references

0 references

Automatic verification of finite-state concurrent systems using temporal logic specifications

0 references

0 references

0 references

Interpolants and Symbolic Model Checking

0 references

Zero-suppressed BDDs and their applications

0 references

Finiteness is mu-ineffable

0 references

Linear temporal logic symbolic model checking

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3176366

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3176366&oldid=36410135"