Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets

摘要

We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.