Normal Petri nets
The author deals with the reachability problem for Petri nets. He defines normal Petri nets (in which the total number of tokens in an arbitrary minimal circuit does not decrease by firing transitions) and shows that their reachability sets are effectively computable semilinear sets.
scientific article; zbMATH DE number 3896314