A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Bisimulation Minimization in an Automata-Theoretic Verification Framework
[chapter]
1998
Lecture Notes in Computer Science
Bisimulation is a seemingly attractive state-space minimization technique because it can be computed automatically and yields the smallest model preserving all -calculus formulas. It is considered impractical for symbolic model checking, however, because the required BDDs are prohibitively large for most designs. We revisit bisimulation minimization, this time in an automata-theoretic framework. Bisimulation has potential in this framework because after intersecting the design with the negation
doi:10.1007/3-540-49519-3_9
fatcat:f6mgmsyoerfjhhw3uingt7whry