Author:
Hofman Piotr,Lasota Sławomir,Lazić Ranko,Leroux Jérôme,Schmitz Sylvain,Totzke Patrick
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160(1–2), 109–127 (2000)
2. Lecture Notes in Computer Science;M Blockelet,2011
3. Bojańczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logic. Meth. Comput. Sci. 10(3:4), 1–44 (2014)
4. Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: preliminary report. In: STOC 1976, pp. 50–54. ACM (1976)
5. Demri, S.: On selective unboundedness of VASS. J. Comput. Syst. Sci. 79(5), 689–713 (2013)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solvability of orbit-finite systems of linear equations;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. Reachability in Vector Addition Systems is Ackermann-complete;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. WQO dichotomy for 3-graphs;Information and Computation;2020-12
4. FORWARD ANALYSIS FOR WSTS, PART III: KARP-MILLER TREES;LOG METH COMPUT SCI;2020
5. Continuous Reachability for Unordered Data Petri Nets is in PTime;Lecture Notes in Computer Science;2019