Sciweavers

156

Voted

MFCS
2010
Springer

152views Theoretical Computer Science» more MFCS 2010»

15 years 3 months ago

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

Philippe Schnoebelen

claim paper

Read More »