Author of the publication

Vector Addition System Reversible Reachability Problem

. Logical Methods in Computer Science, (2013)

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

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems., , , and . CoRR, (2019)Vector Addition System Reversible Reachability Problem.. CONCUR, volume 6901 of Lecture Notes in Computer Science, page 327-341. Springer, (2011)Flat Petri Nets (Invited Talk).. Petri Nets, volume 12734 of Lecture Notes in Computer Science, page 17-30. Springer, (2021)Polynomial Vector Addition Systems With States.. ICALP, volume 107 of LIPIcs, page 134:1-134:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Flat Counter Automata Almost Everywhere!, and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 489-503. Springer, (2005)Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States., , and . Fundam. Informaticae, 169 (1-2): 123-150 (2019)Model Checking Population Protocols., , , and . FSTTCS, volume 65 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)New Lower Bounds for Reachability in Vector Addition Systems., , , , and . FSTTCS, volume 284 of LIPIcs, page 35:1-35:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Preface., , , , and . Fundam. Informaticae, 143 (3-4): i-ii (2016)The convex hull of a regular set of integer vectors is polyhedral and effectively computable, and . CoRR, (2008)