Summary of PN unfolding
Cleanly and structurally analyzes relationships between transitions of a general PN
Size of unfolding can be exponentially larger than reachability graph
(unless a very complex new cutoff criterion by Esparza is used)
But often problem structure keeps it small
Related partial order-based techniques:
- stubborn sets (Valmari ‘93)
- sleep sets (Wolper et al. ‘93)