Coverability in 1-VASS with Disequality Tests.

Shaull Almagor,Nathann Cohen,Guillermo A. Pérez,Mahsa Shirmohammadi,James Worrell

arXiv: Logic in Computer Science（2019）

引用 1|浏览100

暂无评分

摘要

We show that the control-state reachability problem for one-dimensional vector addition systems with disequality tests is solvable in polynomial time. For the test-free case we moreover show that control-state reachability is in NC, i.e., solvable in polylogarithmic parallel time.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要