| Publication | Date of Publication | Type |
|---|
| On the complexity of multi-pushdown games (edit) | 2026-03-23 | Paper |
| Separability in Büchi VASS and singly nonlinear systems of inequalities | 2026-01-14 | Paper |
| Separability and non-determinizability of WSTS | 2025-06-26 | Paper |
| On the separability problem of VASS reachability languages | 2025-06-18 | Paper |
| Regular separability in Büchi VASS | 2024-10-08 | Paper |
Parameterized Verification under Release Acquire is PSPACE-complete
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Make flows small again: revisiting the flow framework | 2023-12-13 | Paper |
Complexity of Liveness in Parameterized Systems
(available as arXiv preprint) | 2023-02-03 | Paper |
Liveness in broadcast networks
Computing | 2022-09-27 | Paper |
Regular separability of well-structured transition systems
(available as arXiv preprint) | 2021-08-04 | Paper |
Parity to safety in polynomial time for pushdown and collapsible pushdown systems
(available as arXiv preprint) | 2021-08-04 | Paper |
Fine-grained complexity of safety verification
Journal of Automated Reasoning | 2020-11-02 | Paper |
On the Complexity of Bounded Context Switching.
(available as arXiv preprint) | 2020-05-27 | Paper |
scientific article; zbMATH DE number 7204383 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Domains for Higher-Order Games
(available as arXiv preprint) | 2020-05-26 | Paper |
Fine-grained complexity of safety verification
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-16 | Paper |
First-order logic with reachability for infinite-state systems
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Summaries for context-free games
(available as arXiv preprint) | 2018-04-19 | Paper |
| What's decidable about availability languages? | 2017-07-13 | Paper |
A theory of partitioned global address spaces
(available as arXiv preprint) | 2017-02-21 | Paper |
Pointer race freedom
Lecture Notes in Computer Science | 2016-03-23 | Paper |
From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Bounds on mobility
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Robustness against Power is PSpace-complete
Automata, Languages, and Programming | 2014-07-01 | Paper |
A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
Logical Methods in Computer Science | 2013-09-26 | Paper |
A theory of name boundedness
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Checking and enforcing robustness against TSO
Programming Languages and Systems | 2013-08-05 | Paper |
Petri net reachability graphs: decidability status of first order properties
Logical Methods in Computer Science | 2012-10-22 | Paper |
A polynomial translation of \(\pi \)-calculus (FCP) to safe Petri nets
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A polynomial translation of \(\pi \)-calculus (FCP) to safe Petri nets
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Petri net reachability graphs: decidability status of FO properties
(available as arXiv preprint) | 2012-08-31 | Paper |
Deciding Robustness against Total Store Ordering
Automata, Languages and Programming | 2011-07-07 | Paper |
The downward-closure of Petri net languages
Automata, Languages and Programming | 2010-09-07 | Paper |
Kleene, Rabin, and Scott Are Available
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
A practical approach to verification of mobile systems using net unfolding
Fundamenta Informaticae | 2009-11-30 | Paper |
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
A theory of structural stationarity in the \(\pi\)-calculus
Acta Informatica | 2009-04-27 | Paper |
Model Checking Duration Calculus: A Practical Approach
Lecture Notes in Computer Science | 2008-09-11 | Paper |
Model checking duration calculus: a practical approach
Formal Aspects of Computing | 2008-08-21 | Paper |
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
An affective mobile robot educator with a full-time job
Artificial Intelligence | 2000-06-04 | Paper |
