Author of the publication

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

, , and . Foundations of Software Science and Computation Structures - 24th International Conference, volume 12650 of Lecture Notes in Computer Science, page 42--61. Springer, (2021)
DOI: 10.1007/978-3-030-71995-1_3

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

Affine Extensions of Integer Vector Addition Systems with States., , , and . Log. Methods Comput. Sci., (2021)Examples for submission to CONCUR'22., , and . (April 2022)A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.. ICALP, volume 80 of LIPIcs, page 88:1-88:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Computing Parameterized Invariants of Parameterized Petri Nets., , and . Petri Nets, volume 12734 of Lecture Notes in Computer Science, page 141-163. Springer, (2021)Regular Model Checking Upside-Down: An Invariant-Based Approach., , and . CONCUR, volume 243 of LIPIcs, page 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Complexity of Reachability in Affine Vector Addition Systems with States., and . LICS, page 224-236. ACM, (2020)Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy., , and . FoSSaCS, volume 12650 of Lecture Notes in Computer Science, page 42-61. Springer, (2021)The Complexity of Verifying Population Protocols., , , and . Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.The Complexity of Verifying Population Protocols., , , and . (2019)heron., , and . (October 2020)