Author of the publication

Coefficient Synthesis for Threshold Automata

. Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings, volume 13608 of Lecture Notes in Computer Science, page 125--139. Springer, (2022)
DOI: 10.1007/978-3-031-19135-0\_9

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

Parameterized verification of coverability in infinite state broadcast networks.. Inf. Comput., (2021)Adaptive Synchronisation of Pushdown Automata., and . CONCUR, volume 203 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Decidability and Complexity of Decision Problems for Affine Continuous VASS.. LICS, page 7:1-7:13. ACM, (2024)Generalized threshold arrangements.. CoRR, (2019)Reachability in Continuous Pushdown VASS., , , and . CoRR, (2023)Complexity of Verification and Synthesis of Threshold Automata., , and . CoRR, (2020)https://arxiv.org/abs/2007.06248.Complexity of controlled bad sequences over finite sets of Nd.. LICS, page 130-140. ACM, (2020)Parameterized Analysis of Reconfigurable Broadcast Networks., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 61-80. Springer, (2022)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)Characterizing Consensus in the Heard-Of Model., and . CONCUR, volume 171 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)