Abstract:
The state-of-art is surveyed of the achievability problem in Petri nets widely used in development of control systems for discrete-time processes. E. Mayr's ideas [1] are embodied in full proof of the achievability. Some related matters are discussed such as solvability of Pressburger's arithmetics, semilinear sets, vector addition graphs, achievability graphs, etc.
Fulltext:
PDF file (5234 kB)