Abstract
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decidability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separations between seemingly related problems. Our main theorem is the very surprising fact that boundedness is undecidable for Petri nets with Reset arcs.
Cite
CITATION STYLE
Dufourd, C., Finkel, A., & Schnoebelen, P. (1998). Reset nets between decidability and undecidability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 103–115). https://doi.org/10.1007/bfb0055044
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
