Abstract
This paper proposes using Zero-Suppressed BDDs for the CTL symbolic model checking of Petri nets. Since the state spaces of Petri nets are often very sparse, it is expected that ZBDDs represent such sparse state spaces more efficiently than BDDs. Further, we propose special BDD/ZBDD operations for Petri nets which accelerate the manipulations of Petri nets. The approaches to handling Petri nets based on BDDs and ZBDDs are compared with several example nets, and it is shown that ZBDDs are more suitable for the symbolic manipulation of Petri nets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have