Property Checking for 1-Place-Unbounded Petri Nets

  title={Property Checking for 1-Place-Unbounded Petri Nets},
  author={Yunhe Wang and Bo Jiang and Li Jiao},
  journal={2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering},
The reach ability tree for an unbounded net system is infinite. By using $\omega$ symbol to represent infinitely many markings, cover ability tree can provide a finite form. However, with too much information lost, it can not check properties such as reach ability, deadlock freedom, liveness, etc. In this paper, an improved reachability tree (IRT for short) is constructed to enrich the$\omega$ representation for 1-place-unbounded nets. Based on the tree containing exactly all the reachable… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

A Modified Reachability Tree for Petri Nets

  • F. Y. Wang
  • IEEE Transactions on Systems, Man, and…
  • 1991
Highly Influential
3 Excerpts

On the liveness problem of 1-placeunbounded Petri nets

  • M. D. Jeng, M. Y. Peng
  • Proceedings of IEEE International Conference on…
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…