| Publication | Date of Publication | Type |
|---|
| How to play in infinite MDPs (invited talk) | 2026-03-18 | Paper |
| Finite-memory strategies for almost-sure energy-meanpayoff objectives in MDPs | 2026-01-14 | Paper |
Strategy complexity of limsup and liminf threshold objectives in countable MDPs, with applications to optimal expected payoffs
Decisions in Economics and Finance | 2025-08-25 | Paper |
Strategy complexity of reachability in countable stochastic 2-player games
Dynamic Games and Applications | 2025-08-07 | Paper |
| Approximating the value of energy-parity objectives in simple stochastic games | 2024-12-03 | Paper |
| Weak bisimulation and model checking for basic parallel processes | 2024-07-05 | Paper |
scientific article; zbMATH DE number 7730613 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs
(available as arXiv preprint) | 2023-08-21 | Paper |
| Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games | 2023-07-11 | Paper |
Model checking PA-processes
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
Logical Methods in Computer Science | 2023-03-22 | Paper |
| Strategy Complexity of Threshold Payoff with Applications to Optimal Expected Payoff | 2022-11-23 | Paper |
scientific article; zbMATH DE number 7561612 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559495 (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 |
| Petri nets with time and cost | 2021-05-06 | Paper |
Petri nets with time and cost
(available as arXiv preprint) | 2021-05-06 | Paper |
| MDPs with energy-parity objectives | 2021-01-19 | Paper |
MDPs with energy-parity objectives
(available as arXiv preprint) | 2021-01-19 | Paper |
| On strong determinacy of countable stochastic games | 2021-01-19 | Paper |
On strong determinacy of countable stochastic games
(available as arXiv preprint) | 2021-01-19 | Paper |
| Parity objectives in countable MDPs | 2021-01-19 | Paper |
Parity objectives in countable MDPs
(available as arXiv preprint) | 2021-01-19 | Paper |
| Reduction of nondeterministic tree automata | 2019-09-17 | Paper |
Reduction of nondeterministic tree automata
(available as arXiv preprint) | 2019-09-17 | Paper |
B\"uchi Objectives in Countable MDPs
(available as arXiv preprint) | 2019-04-25 | Paper |
Efficient reduction of nondeterministic automata with application to language inclusion testing
(available as arXiv preprint) | 2019-02-25 | Paper |
Model checking flat Freeze LTL on one-counter automata
(available as arXiv preprint) | 2019-01-18 | Paper |
Tableau methods for PA-processes
Lecture Notes in Computer Science | 2019-01-15 | Paper |
Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | 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 |
| Model checking flat freeze LTL on one-counter automata | 2018-03-21 | Paper |
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
Journal of Computer and System Sciences | 2017-10-11 | 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 |
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Simulation problems over one-counter nets
Logical Methods in Computer Science | 2016-04-19 | Paper |
Stochastic parity games on lossy channel systems
Logical Methods in Computer Science | 2015-01-15 | Paper |
Advanced automata minimization
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Branching-time model checking gap-order constraint systems
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Priced timed Petri nets
Logical Methods in Computer Science | 2013-11-28 | Paper |
| Weak bisimilarity and regularity of context-free processes is EXPTIME-hard | 2013-09-09 | Paper |
Solving parity games on integer vectors
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Advanced Ramsey-based Büchi automata inclusion testing
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Common intervals of multiple permutations
Algorithmica | 2011-05-10 | Paper |
Multipebble simulations for alternating automata (extended abstract)
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Information and Computation | 2010-08-18 | Paper |
When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Eager Markov Chains
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Stochastic Games with Lossy Channels
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Decisive Markov Chains
Logical Methods in Computer Science | 2008-04-01 | Paper |
Model Checking Probabilistic Pushdown Automata
Logical Methods in Computer Science | 2007-10-11 | Paper |
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Logical Methods in Computer Science | 2007-10-11 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 2163034 (Why is no real title available?) | 2005-04-29 | Paper |
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2038739 (Why is no real title available?) | 2004-02-08 | Paper |
Undecidable problems in unreliable computations.
Theoretical Computer Science | 2003-08-17 | Paper |
Automatic verification of recursive procedures with one integer parameter.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929958 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1927588 (Why is no real title available?) | 2003-06-12 | Paper |
Process rewrite systems.
Information and Computation | 2003-01-14 | Paper |
Simulation preorder over simple process algebras
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1848282 (Why is no real title available?) | 2003-01-01 | Paper |
| scientific article; zbMATH DE number 1759489 (Why is no real title available?) | 2002-11-25 | Paper |
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1670835 (Why is no real title available?) | 2001-11-11 | Paper |
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science | 2001-08-20 | Paper |
Decidability of model checking with the temporal logic EF
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1512704 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1361133 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1304329 (Why is no real title available?) | 1999-11-29 | Paper |
| scientific article; zbMATH DE number 1263840 (Why is no real title available?) | 1999-03-16 | Paper |
| scientific article; zbMATH DE number 1231599 (Why is no real title available?) | 1998-12-21 | Paper |
| scientific article; zbMATH DE number 1231558 (Why is no real title available?) | 1998-12-20 | Paper |
Higher-order rewrite systems and their confluence
Theoretical Computer Science | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 1088051 (Why is no real title available?) | 1997-11-17 | 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 |
