Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

MFCS
2010
Springer

favoriteEmaildiscussreport

152views Theoretical Computer Science» more MFCS 2010»

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

13 years 9 months ago

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

Download www.lsv.ens-cachan.fr

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

Philippe Schnoebelen

Real-time Traffic

Lossy Counter Machines | MFCS 2010 | Petri Nets | Theoretical Computer Science |

claim paper

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MFCS
Authors	Philippe Schnoebelen

Comments (0)