Now showing items 1-1 of 1

    • Complexity of Some Problems in Petri Nets 

      Jones, Neil D.; Landweber, Lawrence H.; Lien, Y. Edmund (University of Wisconsin-Madison Department of Computer Sciences, 1976)
      We consider the complexity of several standard problems for various classes of Petri nets. In particular, the reachability problem, the liveness problem and the k-boundedness problems are analyzed. Some polynomial time ...