Comments on "A Modified Reachability Tree Approach to Analysis of Unbounded Petri Nets
Yu Ru, Weimin Wu, Christoforos N. Hadjicostis
Abstract
Yu Ru, Weimin Wu, Christoforos N. Hadjicostis
Abstract
The above paper introduced the construction of a modified reachability tree (MRT) for (unbounded) Petri nets and its application to reachability, liveness, and deadlock analysis. This note shows via a counterexample that some of the MRT properties claimed in the above paper are incorrect.
OpenAlex reports 26 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The above paper introduced the construction of a modified reachability tree (MRT) for (unbounded) Petri nets and its application to reachability, liveness, and deadlock analysis. This note shows via a counterexample that some of the MRT properties claimed in the above paper are incorrect.
Key concepts: Reachability, Liveness, Petri net, Counterexample, Deadlock, Tree (set theory), Computer science, Reachability problem