Hyper-Ackermannian bounds for pushdown vector addition systems

DOI10.1145/2603088.2603146zbMath1392.68307OpenAlexW2082102587MaRDI QIDQ4635648

Grégoire Sutre, Jérôme Leroux, M. Praveen

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603146

zbMATH Keywords

nested wordsvector addition systemsboundedness problemhyper-Ackermannian complexitywell-structured pushdown systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension ⋮ Unnamed Item ⋮ A lower bound for the coverability problem in acyclic pushdown VAS ⋮ Nested Timed Automata with Frozen Clocks ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Hardness Results for Coverability Problem of Well-Structured Pushdown Systems ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Unnamed Item ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems

This page was built for publication: Hyper-Ackermannian bounds for pushdown vector addition systems