A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games

Le Manh Ha, Van Trung Pham, Thi Ha Duong Phan. A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games. In 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), Ho Chi Minh City, Vietnam, February 27 - March 1, 2012. pages 1-6, IEEE, 2012. [doi]

Abstract

Abstract is missing.