Model Checking of $\omega$-Independent Unbounded Petri Nets for an Unbounded System
Shuo Wang, Ru Yang, Wangyang Yu, Zhijun Ding, Changjun Jiang · IEEE Transactions on Computational Social Systems · 2024
This work on model checking of unbounded Petri nets either not really concern the$\omega$-component or only focus on the$\omega$symbols, which may lead to incorrect judgments. This article proposes a model checking approach of$\omega$-independent unbounded Petri nets. First, this approach can ensure the complete state space required for model checking by analyzing the enabled/unenabled marking set of conditionally enabled transition. Second, a comprehensive model checking process of$\omega$-independent unbounded PN is presented, including the generation of extended new modified reachability graph. Third, two theorems are presented to prove that extended new modified reachability graph includes complete reachable markings and sequences of transitions. Finally, the proposed new approach is illustrated through a practical example.