Author of the publication

Succinct Population Protocols for Presburger Arithmetic

, , , , and . 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, volume 154 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (March 2020)
DOI: 10.4230/LIPIcs.STACS.2020.40

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

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.Affine Extensions of Integer Vector Addition Systems with States., , , and . Log. Methods Comput. Sci., (2021)The ABCs of petri net reachability relaxations.. ACM SIGLOG News, 7 (3): 29-43 (2020)Continuous One-counter Automata., , , , and . ACM Trans. Comput. Log., 24 (1): 3:1-3:31 (January 2023)Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations., , and . CAV (2), volume 13372 of Lecture Notes in Computer Science, page 468-489. Springer, (2022)Directed Reachability for Infinite-State Systems., , and . TACAS (2), volume 12652 of Lecture Notes in Computer Science, page 3-23. Springer, (2021)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)