@paves_intern

On Functions Weakly Computable by Petri Nets and Vector Addition Systems.

, and . RP, volume 8762 of Lecture Notes in Computer Science, page 190-202. Springer, (2014)

Abstract

We show that any unbounded function weakly computable by a Petri net or a VASS cannot be sublinear. This answers a long-standing folklore conjec-ture about weakly computing the inverses of some fast-growing functions. The proof relies on a pumping lemma for sets of runs in Petri nets or VASSes.

Links and resources

Tags

community

  • @paves_intern
  • @dblp
@paves_intern's tags highlighted