| Publication | Date of Publication | Type |
|---|
History-deterministic timed automata
Logical Methods in Computer Science | 2024-11-12 | Paper |
| Parity games on temporal graphs | 2024-10-30 | Paper |
| History-deterministic timed automata | 2024-08-13 | Paper |
scientific article; zbMATH DE number 7730613 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.
(available as arXiv preprint) | 2023-08-08 | Paper |
History-deterministic timed automata are not determinizable
Lecture Notes in Computer Science | 2023-07-21 | Paper |
Timed Basic Parallel Processes
(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 |
scientific article; zbMATH DE number 7561612 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Optimally Resilient Strategies in Pushdown Safety Games
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559495 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559503 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Strategy Complexity of Reachability in Countable Stochastic 2-Player Games | 2022-03-22 | Paper |
Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
(available as arXiv preprint) | 2021-10-18 | Paper |
Universal safety for timed Petri nets is PSPACE-complete
(available as arXiv preprint) | 2021-08-04 | Paper |
| Approximating weak bisimilarity of basic parallel processes | 2021-04-27 | Paper |
Approximating weak bisimilarity of basic parallel processes
(available as arXiv preprint) | 2021-04-27 | 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 |
| MDPs with energy-parity objectives | 2021-01-19 | Paper |
MDPs with energy-parity objectives
(available as arXiv preprint) | 2021-01-19 | Paper |
B\"uchi Objectives in Countable MDPs
(available as arXiv preprint) | 2019-04-25 | Paper |
Trace inclusion for one-counter nets revisited
Theoretical Computer Science | 2018-06-05 | Paper |
Infinite-state energy games
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 |
Reachability in two-dimensional unary vector addition systems with states is NL-complete
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| What makes Petri nets harder to verify: stack or data? | 2018-03-26 | Paper |
A polynomial-time algorithm for reachability in branching VASS in dimension one
(available as arXiv preprint) | 2017-12-19 | Paper |
On boundedness problems for pushdown vector addition systems
(available as arXiv preprint) | 2017-10-27 | Paper |
Decidability of weak simulation on one-counter nets
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Branching-time model checking gap-order constraint systems
Fundamenta Informaticae | 2017-03-16 | Paper |
Simulation over one-counter nets is PSPACE-complete
(available as arXiv preprint) | 2017-02-21 | Paper |
Coverability trees for Petri nets with unordered data
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Simulation problems over one-counter nets
Logical Methods in Computer Science | 2016-04-19 | Paper |
On the coverability problem for pushdown vector addition systems in one dimension
Automata, Languages, and Programming | 2015-11-04 | Paper |
Trace inclusion for one-counter nets revisited
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Branching-time model checking gap-order constraint systems
Lecture Notes in Computer Science | 2014-07-07 | Paper |
| scientific article; zbMATH DE number 5593273 (Why is no real title available?) | 2009-08-10 | Paper |
| scientific article; zbMATH DE number 5593274 (Why is no real title available?) | 2009-08-10 | Paper |
Memoryless Strategies in Stochastic Reachability Games
(available as arXiv preprint) | N/A | Paper |
"Strategy Complexity of B\""uchi Objectives in Concurrent Stochastic Games"
(available as arXiv preprint) | N/A | Paper |
