A lower bound for the coverability problem in acyclic pushdown VAS-Reference-Cited by-同舟云学术

A lower bound for the coverability problem in acyclic pushdown VAS

Author:

Englert Matthias,Hofman Piotr,Lasota Sławomir,Lazić Ranko,Leroux Jérôme,Straszyński Juliusz

Funder

NCN

Leverhulme Trust

French National Research Agency

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. On the coverability problem for pushdown vector addition systems in one dimension;Leroux,2015

2. Coverability is undecidable in one-dimensional pushdown vector addition systems with resets;Schmitz,2019

3. What makes Petri nets harder to verify: stack or data?;Lazic,2017

4. Hyper-Ackermannian bounds for pushdown vector addition systems;Leroux,2014

5. On boundedness problems for pushdown vector addition systems;Leroux,2015

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reachability in Continuous Pushdown VASS;Proceedings of the ACM on Programming Languages;2024-01-05

2. Context-Bounded Verification of Context-Free Specifications;Proceedings of the ACM on Programming Languages;2023-01-09

5. Flat Petri Nets (Invited Talk);Application and Theory of Petri Nets and Concurrency;2021