Author of the publication

The Complexity of Reachability in Affine Vector Addition Systems with States.

, and . LICS, page 224-236. ACM, (2020)

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

Directed Reachability for Infinite-State Systems., , and . CoRR, (2020)Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling., , , , and . CAV (2), volume 12225 of Lecture Notes in Computer Science, page 372-397. Springer, (2020)Preprint: <a href="https://arxiv.org/abs/2005.03555">Link</a><br>#conference.Population Protocols with Unordered Data., and . ICALP, volume 261 of LIPIcs, page 115:1-115:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Succinct Population Protocols for Presburger Arithmetic., , , , and . CoRR, (2019)Towards efficient verification of population protocols., , , and . Formal Methods Syst. Des., 57 (3): 305-342 (2021)The Reachability Problem for Two-Dimensional Vector Addition Systems with States., , , , , , , and . J. ACM, 68 (5): 34:1-34:43 (2021)Continuous One-Counter Automata., , , , and . LICS, page 1-13. IEEE, (2021)Separators in Continuous Petri Nets., and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 81-100. Springer, (2022)Succinct Population Protocols for Presburger Arithmetic., , , , and . STACS, volume 154 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Preprint: <a href="https://arxiv.org/abs/1910.04600">Link</a><br>#conference.The ABCs of petri net reachability relaxations.. ACM SIGLOG News, 7 (3): 29-43 (2020)