Author of the publication

The Complexity of Verifying Population Protocols.

, , , and . Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.

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

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent, and . (2021)https://arxiv.org/abs/2108.07510.Parameterized Analysis of Immediate Observation Petri Nets., , and . Petri Nets, volume 11522 of Lecture Notes in Computer Science, page 365-385. Springer, (2019)#conference.Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction., , and . CoRR, (2024)Observation Petri Nets.. Technical University of Munich, Germany, (2023)Flatness and Complexity of Immediate Observation Petri Nets., , and . CONCUR, volume 171 of LIPIcs, page 45:1-45:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient Restrictions of Immediate Observation Petri Nets, and . (2020)http://arxiv.org/abs/2007.09189.Verification of Population Protocols with Unordered Data., , , , , and . ICALP, volume 297 of LIPIcs, page 156:1-156:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Complexity of Verifying Population Protocols., , , and . (2019)The Complexity of Verifying Population Protocols., , , and . Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.Parameterized Analysis of Reconfigurable Broadcast Networks., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 61-80. Springer, (2022)