| Publication | Date of Publication | Type |
|---|
| Reachability in vector addition systems is primitive-recursive in fixed dimension | 2024-12-19 | Paper |
| New algorithms for combinations of objectives using separating automata | 2024-12-06 | Paper |
| Ackermannian completion of separators | 2024-10-30 | Paper |
State Complexity of Protocols with Leaders
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Lower bounds on the state complexity of population protocols
Distributed Computing | 2023-09-11 | Paper |
| scientific article; zbMATH DE number 7650344 (Why is no real title available?) | 2023-02-03 | Paper |
The Reachability Problem for Petri Nets Is Not Elementary
Journal of the ACM | 2022-12-08 | Paper |
| scientific article; zbMATH DE number 7561336 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561649 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559504 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559493 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Flat Petri nets (invited talk) | 2022-03-21 | Paper |
| Polynomial vector addition systems with states | 2021-07-28 | Paper |
A lower bound for the coverability problem in acyclic pushdown VAS
Information Processing Letters | 2021-03-11 | Paper |
When reachability meets Grzegorczyk
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Efficient Analysis of VASS Termination Complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| scientific article; zbMATH DE number 7297813 (Why is no real title available?) | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297813 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-19 | Paper |
| Polynomial-space completeness of reachability for succinct branching VASS in dimension one | 2020-05-27 | Paper |
The reachability problem for Petri nets is not elementary
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The reachability problem for Petri nets is not elementary
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
Fundamenta Informaticae | 2020-01-24 | Paper |
On functions weakly computable by pushdown Petri nets and related systems
(available as arXiv preprint) | 2020-01-03 | Paper |
| Co-finiteness and co-emptiness of reachability sets in vector addition systems with states | 2019-12-18 | Paper |
Occam's razor applied to the Petri net coverability problem
Theoretical Computer Science | 2018-11-23 | Paper |
Demystifying Reachability in Vector Addition Systems
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Hyper-Ackermannian bounds for pushdown vector addition systems
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Model checking population protocols | 2018-04-19 | Paper |
Occam's razor applied to the Petri net coverability problem
Lecture Notes in Computer Science | 2018-03-26 | Paper |
| Ideal decompositions for vector addition systems (invited talk) | 2018-01-24 | Paper |
On boundedness problems for pushdown vector addition systems
(available as arXiv preprint) | 2017-10-27 | Paper |
| Verification of Population Protocols | 2017-09-12 | Paper |
Presburger vector addition systems
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
On the context-freeness problem for vector addition systems
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Verification of population protocols
Acta Informatica | 2017-04-20 | Paper |
Guiding Craig interpolation with domain-specific abstractions
Acta Informatica | 2016-06-28 | Paper |
Coverability trees for Petri nets with unordered data
Lecture Notes in Computer Science | 2016-06-10 | Paper |
The context-freeness problem is coNP-complete for flat counter systems
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
On the coverability problem for pushdown vector addition systems in one dimension
Automata, Languages, and Programming | 2015-11-04 | Paper |
On functions weakly computable by Petri nets and vector addition systems
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Acceleration for Petri nets
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Vector addition system reachability problem, a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
| The affine hull of a binary automaton is computable in polynomial time | 2013-09-09 | Paper |
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Vector addition system reversible reachability problem
Logical Methods in Computer Science | 2013-04-09 | Paper |
Reachability analysis of communicating pushdown systems
Logical Methods in Computer Science | 2012-10-22 | Paper |
| Place-boundedness for vector addition systems with one zero-test | 2012-08-29 | Paper |
Model checking vector addition systems with one zero-test
Logical Methods in Computer Science | 2012-07-03 | Paper |
Vector Addition System Reversible Reachability Problem
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Vector addition system reachability problem: a short self-contained proof
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Interpolating quantifier-free Presburger arithmetic
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
The general vector addition system reachability problem by Presburger inductive invariants
Logical Methods in Computer Science | 2010-09-21 | Paper |
Reachability analysis of communicating pushdown systems
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters | 2009-12-18 | Paper |
Polynomial Precise Interval Analysis Revisited
Lecture Notes in Computer Science | 2009-11-12 | Paper |
A Generalization of Semenov’s Theorem to Automata over Real Numbers
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
TaPAS: The Talence Presburger Arithmetic Suite
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Accelerated Data-Flow Analysis
Static Analysis | 2009-03-03 | Paper |
Structural Presburger digit vector automata
Theoretical Computer Science | 2009-01-08 | Paper |
Convex Hull of Arithmetic Automata
Static Analysis | 2008-08-28 | Paper |
Acceleration in Convex Data-Flow Analysis
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Accelerating Interpolation-Based Model-Checking
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 1954380 (Why is no real title available?) | 2003-07-28 | Paper |
