Complexity Analysis of the Backward Coverability Algorithm for VASS-Reference-Cited by-同舟云学术

Complexity Analysis of the Backward Coverability Algorithm for VASS

Published:2011 Issue: Volume: Page:96-109
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bozzelli Laura,Ganty Pierre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24288-5_10

Reference17 articles.

1. Abdulla, P., Čerāns, K., Jonsson, B., Tsay, Y.: General Decidability Theorems for Infinite-State Systems. In: LICS 1996, pp. 313–321. IEEE Computer Society Press, Los Alamitos (1996)

2. Arnold, A., Latteux, M.: Recursivite et cones rationnels fermes par intersection. Calcolo 15, 381–394 (1978)

3. Lecture Notes in Computer Science;G. Delzanno,2000

4. Lecture Notes in Computer Science;G. Delzanno,2001

5. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics 35, 413–422 (1913)

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

1. A State-of-the-Art Karp-Miller Algorithm Certified in Coq;Lecture Notes in Computer Science;2024

2. The ideal view on Rackoff's coverability technique;Information and Computation;2021-04

3. Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains;Programming Languages and Systems;2021

4. Deciding Fast Termination for Probabilistic VASS with Nondeterminism;Automated Technology for Verification and Analysis;2019

5. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09