Author of the publication

Unboundedness Problems for Languages of Vector Addition Systems.

, , and . ICALP, volume 107 of LIPIcs, page 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reachability Problem for Weak Multi-Pushdown Automata., , and . Logical Methods in Computer Science, (2013)Shortest paths in one-counter systems., , , , and . Log. Methods Comput. Sci., (2019)Acyclic Petri and Workflow Nets with Resets., , , , and . FSTTCS, volume 284 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Reachability Problem for Weak Multi-Pushdown Automata., , and . CONCUR, volume 7454 of Lecture Notes in Computer Science, page 53-68. Springer, (2012)Timed Basic Parallel Processes., , and . CONCUR, volume 140 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Shortest paths in one-counter systems., , , , and . CoRR, (2015)Linear equations for unordered data vectors., and . CoRR, (2021)Separability by Short Subsequences and Subwords., and . ICDT, volume 31 of LIPIcs, page 230-246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Unboundedness Problems for Languages of Vector Addition Systems., , and . ICALP, volume 107 of LIPIcs, page 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A lower bound for the coverability problem in acyclic pushdown VAS., , , , , and . Inf. Process. Lett., (2021)