| Publication | Date of Publication | Type |
|---|
History-deterministic timed automata
Logical Methods in Computer Science | 2024-11-12 | Paper |
Priority promotion with Parysian flair
Journal of Computer and System Sciences | 2024-10-29 | Paper |
Natural colors of Infinite words
| 2024-09-12 | Paper |
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
Theoretical Computer Science | 2024-06-26 | Paper |
Semantic flowers for good-for-games and deterministic automata
Information Processing Letters | 2024-03-13 | Paper |
Omega-Regular Objectives in Model-Free Reinforcement Learning
Tools and Algorithms for the Construction and Analysis of Systems | 2023-11-24 | Paper |
Accelerated model checking of parametric Markov chains
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
History-deterministic timed automata are not determinizable
Lecture Notes in Computer Science | 2023-07-21 | Paper |
Incremental Verification of Parametric and Reconfigurable Markov Chains
Quantitative Evaluation of Systems | 2023-06-28 | Paper |
An impossibility result in automata-theoretic reinforcement learning
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Alternating good-for-MDPs automata
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
| 2023-04-21 | Paper |
Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives
1517.68331 | 2022-12-22 | Paper |
Good-for-MDPs automata for probabilistic analysis and reinforcement learning
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Model-Free Reinforcement Learning for Stochastic Parity Games
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7533361 (Why is no real title available?)
| 2022-05-28 | Paper |
Model-free reinforcement learning for branching Markov decision processes
| 2022-03-25 | Paper |
scientific article; zbMATH DE number 7471697 (Why is no real title available?)
| 2022-02-09 | Paper |
\(\omega \)-automata
| 2022-02-04 | Paper |
Making the best of limited memory in multi-player discounted sum games
| 2021-12-03 | Paper |
Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
| 2021-10-18 | Paper |
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Physics Letters B | 2021-10-12 | Paper |
Maximum rooted connected expansion
| 2021-08-04 | Paper |
Maximum rooted connected expansion
Theoretical Computer Science | 2021-06-22 | Paper |
Rapid recovery for systems with scarce faults
| 2021-04-27 | Paper |
Practical distributed control synthesis
| 2021-03-10 | Paper |
Optimal time-abstract schedulers for CTMDPs and Markov games
| 2021-02-16 | Paper |
MDPs with energy-parity objectives
| 2021-01-19 | Paper |
Fast two-robot disk evacuation with wireless communication
Theoretical Computer Science | 2020-11-06 | Paper |
Learning to complement Büchi automata
Lecture Notes in Computer Science | 2020-07-07 | Paper |
Eternally dominating large grids
Theoretical Computer Science | 2019-10-16 | Paper |
Complementing semi-deterministic Büchi automata
| 2019-09-17 | Paper |
Parity games with weights
| 2019-09-13 | Paper |
A simple algorithm for solving qualitative probabilistic parity games
Computer Aided Verification | 2019-05-03 | Paper |
Buying optimal payoffs in bi-matrix games
Games | 2018-12-10 | Paper |
Fast two-robot disk evacuation with wireless communication
Lecture Notes in Computer Science | 2018-08-16 | Paper |
Incentive Stackelberg mean-payoff games
Software Engineering and Formal Methods | 2018-07-06 | Paper |
Optimal control for multi-mode systems with discrete costs
| 2017-12-01 | Paper |
Model-checking iterated games
Acta Informatica | 2017-10-26 | Paper |
Lazy probabilistic model checking without determinisation
| 2017-09-12 | Paper |
Perpetually dominating large grids
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Bounded-rate multi-mode systems based motion planning
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Solving parity games in big steps
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Efficient approximation of optimal control for continuous-time Markov games
Information and Computation | 2016-03-10 | Paper |
Controlling loosely cooperating processes
Theoretical Computer Science | 2015-12-15 | Paper |
Multiplayer cost games with simple Nash equilibria
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Symmetric strategy improvement
Automata, Languages, and Programming | 2015-11-04 | Paper |
Knowledge = observation + memory + computation
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Synthesis of succinct systems
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Complexity of node coverage games
Theoretical Computer Science | 2015-05-18 | Paper |
Determinising parity automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Tight bounds for complementing parity automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science | 2014-09-02 | Paper |
Editorial: Special issue on synthesis
Acta Informatica | 2014-07-03 | Paper |
Distributed synthesis is simply undecidable
Information Processing Letters | 2014-04-15 | Paper |
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Model-checking iterated games
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
Logical Methods in Computer Science | 2013-06-20 | Paper |
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Theoretical Computer Science | 2013-02-19 | Paper |
Bounded satisfiability for PCTL
| 2012-11-22 | Paper |
Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Synthesis of succinct systems
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Playing optimally on timed automata with random delays
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Time and parallelizability results for parity games with bounded treewidth
Automata, Languages, and Programming | 2012-11-01 | Paper |
Efficient approximation of optimal control for continuous-time Markov games
| 2012-08-31 | Paper |
Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
| 2012-08-29 | Paper |
Büchi complementation made tight
| 2012-04-24 | Paper |
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Acta Informatica | 2012-03-23 | Paper |
The buck stops here: order, chance, and coordination in distributed control
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Coordination logic
Computer Science Logic | 2010-09-03 | Paper |
From Parity and Payoff Games to Linear Programming
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Tighter Bounds for the Determinisation of Büchi Automata
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
Computer Science Logic | 2009-03-12 | Paper |
Automatic Synthesis of Assumptions for Compositional Model Checking
Lecture Notes in Computer Science | 2009-03-11 | Paper |
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
Computer Science Logic | 2008-11-20 | Paper |
Synthesis for Probabilistic Environments
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Selective Approaches for Solving Weak Games
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
ATL* Satisfiability Is 2EXPTIME-Complete
Automata, Languages and Programming | 2008-08-19 | Paper |
Bounded Synthesis
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Distributed Synthesis for Alternating-Time Logics
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Solving Parity Games in Big Steps
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Synthesis of Asynchronous Systems
Logic-Based Program Synthesis and Transformation | 2007-09-10 | Paper |
SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
International Journal of Foundations of Computer Science | 2007-03-13 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
