In: Lecture Notes in Computer Science, Vol. 1644: Automata, Languages and Programming, pages 301-310. Springer-Verlag, 1999.
Abstract: Place/transition nets with reset and transfer arcs can be seen as counter-machines with some restricted set of operations. Surprisingly, several problems related to boundedness are harder for reset nets that for the more expressive transfer nets. The main result of this paper is that boundedness is undecidable for nets with three reset arcs, while it is decidable for nets with two resetable places.
Keywords: boundedness property, decidability, reset arcs, reset place/transition nets, transfer arcs.
Back to the Petri Nets Bibliography