Symbolic Model Checking with Partitioned Transition Relations

Burch, Jerry; Clarke, Edmund M; Long, David

doi:10.1184/R1/6610106.v1

Symbolic Model Checking with Partitioned Transition Relations

https://doi.org/10.1184/R1/6610106

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

Keywords

computer sciences Information and Computing Sciences not elsewhere classified

Licence

In Copyright

Symbolic Model Checking with Partitioned Transition Relations

History

Date

Usage metrics

Categories

Keywords

Licence

Exports