Model Checking Vector Addition Systems with one zero-test-Reference-Cited by-同舟云学术

Model Checking Vector Addition Systems with one zero-test

Published:2012-06-19 Issue:2 Volume:8 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Bonnet Rémi,FInkel Alain,Leroux Jérôme,Zeitoun Marc

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference36 articles.

1. P. A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In11th IEEE Symp. on Logic in Computer Science, LICS'96, pages 313-321, New Brunswick, New Jersey, 1996. IEEE Computer Society Press.

2. P. A. Abdulla and R. Mayr. Minimal cost reachability/coverability in priced timed Petri nets. In L. de Alfaro, editor,3rd Int. Conf. on Foundations of Software Science and Computation Structures, FoSSaCS'09, volume 5504 ofLect. Notes Comp. Sci., pages 348-363, York, UK, 2009. Springer.

3. M. F. Atig and P. Ganty. Approximating Petri net reachability along context-free traces. In31th IARCS Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'11, volume 13 ofLIPIcs, pages 152-163. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.

4. H. Baker. Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems. M.I.T., Project MAC, CSGM 1979, 1973.

5. M. Blockelet and S. Schmitz. Model checking coverability graphs of vector addition systems. In F. Murlak and P. Sankowski, editors,Mathematical Foundations of Computer Science, MFCS'11, volume 6907 ofLect. Notes Comp. Sci., pages 108-119. Springer, 2011.

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

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

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

3. An Approach to Computing Downward Closures;Automata, Languages, and Programming;2015

4. Zero-reachability in probabilistic multi-counter automata;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);2014-07-14

5. A Survey of Decidability Results for Elementary Object Systems;Fundamenta Informaticae;2014