Skip to Main content Skip to Navigation
Journal articles

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

Abstract : We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions F_α for α < ω^ω, hence they are computationally more powerful than standard vector addition systems. On the other hand they cannot weakly compute the inverses (F_α)^-1 or indeed any sublinear function. The proof relies on a pumping lemma for runs of GVASes that is of independent interest.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02506437
Contributor : Grégoire Sutre <>
Submitted on : Thursday, March 12, 2020 - 12:59:27 PM
Last modification on : Friday, March 13, 2020 - 1:44:16 AM

Links full text

Identifiers

Citation

Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩. ⟨hal-02506437⟩

Share

Metrics

Record views

15