Boundedness of Reset P/T Nets

. P/T nets with reset and transfer arcs can be seen as countermachines with some restricted set of operations. Surprisingly, several problems related to boundedness are harder for Reset nets than for the more expressive Transfer nets. Our main result is that boundedness is undecidable for nets with three reset arcs, while it is decidable for nets with two resetable places. 1 Introduction "Infinite-state transition systems" is a generic name for a large collection of computational models that go beyond finite-state systems but where some decidability results exist. These infinite systems (for short) are currently under active study for several reasons. First some applications use models that cannot easily be abstracted into finite-state systems (e.g., hybrid systems). Then, some models only go beyond finite-state in a very specific way (e.g., parameterized systems, lossy channel systems). Finally, verification methods designed for infinite-state systems may help understand where and how..