Author:
Leroux Jérôme,Praveen M.,Sutre Grégoire
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Atig, M.F., Habermehl, P.: On Yen’s path logic for Petri nets. Int. J. Found. Comput. Sci. 22(4), 783–799 (2011)
2. Lecture Notes in Computer Science;M. Blockelet,2011
3. Demri, S.: On selective unboundedness of VASS. In: Proc. INFINITY. EPTCS, vol. 39, pp. 1–15 (2010)
4. Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS 52, 244–262 (1994)
5. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences 3(2), 147–195 (1969)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. When Reachability Meets Grzegorczyk;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
2. The complexity of reachability in vector addition systems;ACM SIGLOG News;2016-02-17
3. The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems;Automated Technology for Verification and Analysis;2014