The Reachability Problem for Vector Addition System with One Zero-Test-Reference-Cited by-同舟云学术

The Reachability Problem for Vector Addition System with One Zero-Test

Published:2011 Issue: Volume: Page:145-157
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2011
language:
Short-container-title:

Author:

Bonnet Rémi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22993-0_16.pdf

Reference13 articles.

1. Lecture Notes in Computer Science;P. Abdulla,2009

2. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313–321 (1996)

3. Bonnet, R.: The reachability problem for vector addition systems with one zero-test. Research Report LSV-11-11, Laboratoire Spécification et Vérification, ENS Cachan, France, pages 19 (May 2011)

4. Bonnet, R., Finkel, A., Leroux, J., Zeitoun, M.: Place-boundedness for vector addition systems with one zero-test. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010, Leibniz International Proceedings in Informatics, Chennai, India, vol. 8, pp. 192–203. Leibniz-Zentrum für Informatik (December 2010)

5. Lecture Notes in Computer Science;A. Finkel,2010

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

1. The Reachability Problem for Petri Nets is Not Primitive Recursive;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Coverability, Termination, and Finiteness in Recursive Petri Nets;Fundamenta Informaticae;2022-01-10

3. Coverability and Termination in Recursive Petri Nets;Application and Theory of Petri Nets and Concurrency;2019

4. Undecidability of performance equivalence of Petri nets;Theoretical Computer Science;2016-12

5. Parameterized verification;International Journal on Software Tools for Technology Transfer;2016-06-24