Author of the publication

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

Verification column.. ACM SIGLOG News, 5 (3): 66 (2018)The reachability problem for branching vector addition systems requires doubly-exponential space.. Inf. Process. Lett., 110 (17): 740-745 (2010)KReach: A Tool for Reachability in Petri Nets., and . TACAS (1), volume 12078 of Lecture Notes in Computer Science, page 405-412. Springer, (2020)The Covering and Boundedness Problems for Branching Vector Addition Systems., , , and . FSTTCS, volume 4 of LIPIcs, page 181-192. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)The reachability problem for Petri nets is not elementary., , , , and . STOC, page 24-33. ACM, (2019)Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets., , , , and . FORMATS, volume 5215 of Lecture Notes in Computer Science, page 63-77. Springer, (2008)A pseudo-quasi-polynomial algorithm for mean-payoff parity games., , and . LICS, page 325-334. ACM, (2018)Succinct progress measures for solving parity games., and . LICS, page 1-9. IEEE Computer Society, (2017)LTL with the Freeze Quantifier and Register Automata., and . LICS, page 17-26. IEEE Computer Society, (2006)Safety alternating automata on data words.. ACM Trans. Comput. Log., 12 (2): 10:1-10:24 (2011)