1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 1 cited
Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations
Christian Appold
Symbolic model checking by using BDDs has greatly improved the applicability of model checking. Nevertheless, BDD based symbolic model checking can still be very memory and time co…
cs.LO2010★ 1 cited
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking
Christian Appold
One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking…