Home
People
Research
Publications
Tools
Teaching
Outreach
Contact
Light
Dark
Automatic
learning automata
State space reductions for scalable verification of asynchronous designs
This paper presents several state space reductions for verifying non-trivial asynchronous designs with a compositional minimization approach. These reductions result in a reduced model that contains the exact set of observably equivalent behavior. …
Cite
×