On Functions Weakly Computable by Pushdown Petri Nets and Related Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2019

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

Résumé

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.

Dates et versions

hal-02506437 , version 1 (12-03-2020)

Identifiants

Citer

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, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩. ⟨hal-02506437⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More