Author of the publication

Fast Termination and Workflow Nets.

, , and . CAV (1), volume 13964 of Lecture Notes in Computer Science, page 132-155. Springer, (2023)

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

Timed Basic Parallel Processes., , and . CONCUR, volume 140 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reachability Problem for Weak Multi-Pushdown Automata., , and . CONCUR, volume 7454 of Lecture Notes in Computer Science, page 53-68. Springer, (2012)Linear equations for unordered data vectors., and . CoRR, (2021)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)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)Separability by Short Subsequences and Subwords., and . ICDT, volume 31 of LIPIcs, page 230-246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Parikh's theorem for infinite alphabets., , , and . LICS, page 1-13. IEEE, (2021)Solvability of orbit-finite systems of linear equations., , and . LICS, page 11:1-11:13. ACM, (2022)The complexity of regular abstractions of one-counter languages., , , , , and . LICS, page 207-216. ACM, (2016)