| Publication | Date of Publication | Type |
|---|
| The complexity of soundness in workflow nets | 2024-12-06 | Paper |
| Population protocols with unordered data | 2024-11-14 | Paper |
Separators in Continuous Petri Nets
Logical Methods in Computer Science | 2024-03-11 | Paper |
Separators in continuous Petri nets
Lecture Notes in Computer Science | 2024-01-23 | Paper |
| Automata theory. An algorithmic approach | 2023-11-24 | Paper |
Succinct Population Protocols for Presburger Arithmetic
(available as arXiv preprint) | 2023-02-07 | Paper |
Continuous One-counter Automata
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
Expressive Power of Broadcast Consensus Protocols
(available as arXiv preprint) | 2023-02-03 | Paper |
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Journal of the ACM | 2022-12-08 | Paper |
| Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations | 2022-12-07 | Paper |
Towards efficient verification of population protocols
Formal Methods in System Design | 2021-12-08 | Paper |
Directed reachability for infinite-state systems
(available as arXiv preprint) | 2021-10-18 | Paper |
scientific article; zbMATH DE number 7407775 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407775 (Why is no real title available?) | 2021-10-08 | Paper |
scientific article; zbMATH DE number 7407773 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407773 (Why is no real title available?) | 2021-10-08 | Paper |
| Affine extensions of integer vector addition systems with states | 2021-08-04 | Paper |
Automatic analysis of expected termination time for population protocols
(available as arXiv preprint) | 2021-08-04 | Paper |
Checking qualitative liveness properties of replicated systems with stochastic scheduling
(available as arXiv preprint) | 2021-02-09 | Paper |
The complexity of reachability in affine vector addition systems with states
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Black Ninjas in the dark: formal analysis of population protocols
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| Logics for continuous reachability in Petri nets and vector addition systems with states | 2021-01-19 | Paper |
| Forward analysis for WSTS. III: Karp-Miller trees | 2020-11-25 | Paper |
Large flocks of small birds: on the minimal size of population protocols
(available as arXiv preprint) | 2020-08-05 | Paper |
Forward analysis for WSTS. III: Karp-Miller trees
(available as arXiv preprint) | 2020-06-26 | Paper |
| Forward analysis for WSTS. III: Karp-Miller trees | 2020-06-26 | Paper |
Approaching the coverability problem continuously
(available as arXiv preprint) | 2019-09-17 | Paper |
Reachability in two-dimensional vector addition systems with states is PSPACE-complete
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Handling infinitely branching well-structured transition systems
Information and Computation | 2017-12-20 | Paper |
The logical view on continuous Petri nets
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
scientific article; zbMATH DE number 6790161 (Why is no real title available?)
(available as arXiv preprint) | 2017-10-12 | Paper |
Towards efficient verification of population protocols
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
The complexity of intersecting finite automata having few final states
Computational Complexity | 2016-11-30 | Paper |
Handling infinitely branching WSTS
Automata, Languages, and Programming | 2014-07-01 | Paper |
The complexity of intersecting finite automata having few final states
Computer Science – Theory and Applications | 2012-09-10 | Paper |
