Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS（2010）
摘要
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
更多查看译文
关键词
lossy counter machine,revisiting ackermann-hardness,reset petri net,petri net
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要