In: Akademiya Nauk SSSR., Avtomatika i Telemekhanika Avtomat. i Telemekh., No. 11, pages 3-39. 1988. In Russian.
Also in: Automation and Remote Control, Vol. 49, No. 11, part 1, pages 1393-1422. 1988. English translation.
Abstract: This survey is based mainly on a paper by E. W. Mayr (SIAM J. Comput., Vol. 13, No. 3, pp. 441--460 (Aug., 1984)). The author discusses the reachability problem for Petri nets and decidability or solvability for Presburger arithmetic, reachability graphs, semilinear sets, vector addition systems, and some connections among these problems. At the end of the paper the author presents some generalizations and problems concerning the reachability problem.
Keywords: reachability problem solvability; vector addition system; decidability (or) solvability (for)Presburger arithmetic.
Back to the Petri Nets Bibliography