Browse
Browse and Search
Search
Symbolic Model Checking with Partitioned Transition Relations
Cite
Download
(601.71 kB)
Share
Embed
journal contribution
posted on 2008-10-01, 00:00
authored by
Jerry Burch
,
Edmund M Clarke
,
David Long
We significantly reduce the complexity of BDD-based symbolic verification by using partitioned transition relations to represent state transition graphs.
History
Date
2008-10-01
Usage metrics
0
0
0
Categories
Other information and computing sciences not elsewhere classified
Keywords
computer sciences
Information and Computing Sciences not elsewhere classified
Licence
In Copyright
Exports
Select an option
RefWorks
RefWorks
BibTeX
BibTeX
Ref. manager
Ref. manager
Endnote
Endnote
DataCite
DataCite
NLM
NLM
DC
DC