Legal firing sequence and related problems of Petri nets

Abstract

Development of computational tools and techniques dealing with large-scale Petri nets will provide a firm foundation of Petri net theory. A discussion is presented of the computational complexity aspect of the legal firing sequence problem (LFS) and some related problems of Petri nets, each having applications to practical problems. Their NP-completeness and polynomial-time solvability are presented.<>