| Publication | Date of Publication | Type |
|---|
| Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs | 2025-01-09 | Dataset |
| Graph planning with expected finite horizon | 2024-12-19 | Paper |
| Entropic risk for turn-based stochastic games | 2024-12-03 | Paper |
Entropic risk for turn-based stochastic games
Information and Computation | 2024-12-03 | Paper |
Stochastic games with lexicographic objectives
Formal Methods in System Design | 2024-11-04 | Paper |
On lexicographic proof rules for probabilistic termination
Formal Aspects of Computing | 2024-09-25 | Paper |
| Complexity of spatial games | 2024-09-12 | Paper |
| Algorithms and hardness results for computing cores of Markov chains | 2024-09-12 | Paper |
| R2: boosting liquidity in payment channel networks with online admission control | 2024-07-17 | Paper |
| Faster algorithm for turn-based stochastic games with bounded treewidth | 2024-05-14 | Paper |
| Strategy Representation by Decision Trees with Linear Classifiers | 2024-03-14 | Paper |
Run-time optimization for learned controllers through quantitative games
Computer Aided Verification | 2024-02-16 | Paper |
| scientific article; zbMATH DE number 7799620 (Why is no real title available?) | 2024-02-05 | Paper |
| Automated tail bound analysis for probabilistic recurrence relations | 2024-02-01 | Paper |
| MDPs as distribution transformers: affine invariant synthesis for safety objectives | 2024-02-01 | Paper |
| A learner-verifier framework for neural network controllers and certificates of stochastic systems | 2023-12-13 | Paper |
New approaches for almost-sure termination of probabilistic programs
Programming Languages and Systems | 2023-08-02 | Paper |
Parameter-Independent Strategies for pMDPs via POMDPs
Quantitative Evaluation of Systems | 2023-06-28 | Paper |
Symbolic algorithms for graphs and Markov decision processes with fairness objectives
Computer Aided Verification | 2023-05-05 | Paper |
| On Lexicographic Proof Rules for Probabilistic Termination | 2023-04-21 | Paper |
scientific article; zbMATH DE number 7650871 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Long-Run Average Behavior of Vector Addition Systems with States
(available as arXiv preprint) | 2023-02-03 | Paper |
Combinations of Qualitative Winning for Stochastic Parity Games
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7649915 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth
1517.68263 | 2022-12-22 | Paper |
| Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs | 2022-12-07 | Paper |
Non-polynomial worst-case analysis of recursive programs
(available as arXiv preprint) | 2022-08-12 | Paper |
scientific article; zbMATH DE number 7559393 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
(available as arXiv preprint) | 2022-07-18 | Paper |
Value iteration for long-run average reward in Markov decision processes
(available as arXiv preprint) | 2022-07-01 | Paper |
Automated recurrence analysis for almost-linear expected-runtime bounds
(available as arXiv preprint) | 2022-07-01 | Paper |
Graph planning with expected finite horizon
Journal of Computer and System Sciences | 2022-06-13 | Paper |
Finite-memory strategies in POMDPs with long-run average objectives
Mathematics of Operations Research | 2022-05-17 | Paper |
Finite-memory strategies in POMDPs with long-run average objectives
Mathematics of Operations Research | 2022-05-17 | Paper |
Stateless model checking under a reads-value-from equivalence
(available as arXiv preprint) | 2022-03-25 | Paper |
Faster algorithms for quantitative verification in bounded treewidth graphs
Formal Methods in System Design | 2021-12-08 | Paper |
Algorithms and conditional lower bounds for planning problems
Artificial Intelligence | 2021-11-02 | Paper |
Algorithms and conditional lower bounds for planning problems
Artificial Intelligence | 2021-11-02 | Paper |
On satisficing in quantitative games
(available as arXiv preprint) | 2021-08-04 | Paper |
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
(available as arXiv preprint) | 2021-08-04 | Paper |
| Approximating the minimum cycle mean | 2021-06-09 | Paper |
| A reduction from parity games to simple stochastic games | 2021-03-03 | Paper |
A reduction from parity games to simple stochastic games
(available as arXiv preprint) | 2021-03-03 | Paper |
Termination Analysis of Probabilistic Programs with Martingales
Foundations of Probabilistic Programming | 2021-02-16 | Paper |
| Discounting in games across time scales | 2021-02-16 | Paper |
Stochastic games with lexicographic reachability-safety objectives
(available as arXiv preprint) | 2021-02-09 | Paper |
Approximating values of generalized-reachability stochastic games
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Optimal strategies for selecting coordinators
Discrete Applied Mathematics | 2020-12-29 | Paper |
Deciding fast termination for probabilistic VASS with nondeterminism
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Bidirectional nested weighted automata
(available as arXiv preprint) | 2020-05-27 | Paper |
Improved set-based symbolic algorithms for parity games
(available as arXiv preprint) | 2020-05-26 | Paper |
| scientific article; zbMATH DE number 7204389 (Why is no real title available?) | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7204395 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Faster algorithms for mean-payoff parity games
(available as arXiv preprint) | 2020-05-26 | Paper |
The cost of exactness in quantitative reachability
Lecture Notes in Computer Science | 2020-02-24 | Paper |
| Termination of nondeterministic probabilistic programs | 2020-01-23 | Paper |
Assume-guarantee synthesis for concurrent reactive programs with partial information
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Strategy representation by decision trees in reactive synthesis
(available as arXiv preprint) | 2019-09-16 | Paper |
Quantitative analysis of smart contracts
(available as arXiv preprint) | 2019-09-13 | Paper |
Quantitative automata under probabilistic semantics
Logical Methods in Computer Science | 2019-08-13 | Paper |
Quasipolynomial set-based symbolic algorithms for parity games
EPiC Series in Computing | 2019-07-04 | Paper |
| Limits on amplifiers of natural selection under death-Birth updating | 2019-06-06 | Paper |
An \(O(n^2)\) time algorithm for alternating Büchi games
(available as arXiv preprint) | 2019-05-10 | Paper |
| An \(O(n^2)\) time algorithm for alternating Büchi games | 2019-05-10 | Paper |
| Termination criteria for solving concurrent safety and reachability games | 2019-05-06 | Paper |
Termination analysis of probabilistic programs through Positivstellensatz's
Computer Aided Verification | 2019-05-03 | Paper |
Density games
Journal of Theoretical Biology | 2018-10-04 | Paper |
Evolutionary game dynamics in populations with different learners
Journal of Theoretical Biology | 2018-09-26 | Paper |
| Quantitative monitor automata | 2018-08-27 | Paper |
Graph Games and Reactive Synthesis
Handbook of Model Checking | 2018-07-20 | Paper |
Evolution of decisions in population games with sequentially searching individuals
Games | 2018-07-10 | Paper |
The complexity of mean-payoff pushdown games
Journal of the ACM | 2018-05-17 | Paper |
Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
Journal of Theoretical Biology | 2018-05-15 | Paper |
| Computational Approaches for Stochastic Shortest Path on Succinct MDPs | 2018-04-24 | Paper |
Improved algorithms for one-pair and \(k\)-pair Streett objectives
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Nested weighted automata
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Quantitative automata under probabilistic semantics
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Perfect-information stochastic games with generalized mean-payoff objectives
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Nested weighted automata
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Nested weighted limit-average automata of bounded width
(available as arXiv preprint) | 2018-03-21 | Paper |
Conditionally Optimal Algorithms for Generalized B\"uchi Games
(available as arXiv preprint) | 2018-03-21 | Paper |
| Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter | 2018-03-15 | Paper |
Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
(available as arXiv preprint) | 2018-03-15 | Paper |
| Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs | 2018-03-02 | Paper |
Faster algorithms for quantitative verification in constant treewidth graphs
(available as arXiv preprint) | 2018-03-01 | Paper |
| Faster algorithms for quantitative verification in constant treewidth graphs | 2018-03-01 | Paper |
Counterexample explanation by learning small strategies in Markov decision processes
(available as arXiv preprint) | 2018-03-01 | Paper |
Automated competitive analysis of real-time scheduling with graph games
Real-Time Systems | 2018-02-16 | Paper |
Computation tree logic for synchronization properties
(available as arXiv preprint) | 2017-12-19 | Paper |
Pushdown reachability with constant treewidth
Information Processing Letters | 2017-11-03 | Paper |
Stochastic invariants for probabilistic termination
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Improved algorithms for parity and Streett objectives
(available as arXiv preprint) | 2017-10-12 | Paper |
Edit distance for pushdown automata
(available as arXiv preprint) | 2017-10-12 | Paper |
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification | 2017-09-29 | Paper |
Amplifiers of selection
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
Obligation Blackwell games and p-automata
Journal of Symbolic Logic | 2017-08-03 | Paper |
| Unifying two views on multiple mean-payoff objectives in Markov decision processes | 2017-07-13 | Paper |
Trading performance for stability in Markov decision processes
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Hyperplane separation technique for multidimensional mean-payoff games
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Temporal logic motion planning using POMDPs with parity objectives
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Faster algorithms for weighted recursive state machines
Programming Languages and Systems | 2017-05-19 | Paper |
Synthesis of memory-efficient ``real-time controllers for safety objectives
Proceedings of the 14th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Decidable problems for probabilistic automata on infinite words
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Partial-observation stochastic games: how to win when belief fails
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Quantitative Temporal Simulation and Refinement Distances for Timed Systems
IEEE Transactions on Automatic Control | 2017-05-16 | Paper |
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Mean-payoff pushdown games
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Edit distance for timed automata
Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Quantitative fair simulation games
Information and Computation | 2017-05-12 | Paper |
Doomsday equilibria for omega-regular games
Information and Computation | 2017-05-12 | Paper |
| What is decidable about partially observable Markov decision processes with omega-regular objectives | 2017-02-02 | Paper |
Infinite-state games with finitary conditions
(available as arXiv preprint) | 2017-02-02 | Paper |
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
(available as arXiv preprint) | 2017-01-26 | Paper |
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
Nonlinear Analysis. Hybrid Systems | 2016-12-15 | Paper |
Trading performance for stability in Markov decision processes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Quantitative interprocedural analysis
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Assume-guarantee synthesis for digital contract signing
Formal Aspects of Computing | 2016-08-05 | Paper |
What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Optimal cost almost-sure reachability in POMDPs
Artificial Intelligence | 2016-03-08 | Paper |
Randomness for free
Information and Computation | 2015-12-07 | Paper |
Edit distance for pushdown automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
The Complexity of Synthesis from Probabilistic Components
Automata, Languages, and Programming | 2015-11-04 | Paper |
CEGAR for compositional analysis of qualitative properties in Markov decision processes
Formal Methods in System Design | 2015-10-20 | Paper |
Finitary winning in \({\omega}\)-regular games
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Quantitative languages
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Temporal specifications with accumulative values
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Qualitative concurrent parity games
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Measuring and synthesizing systems in probabilistic environments
Journal of the ACM | 2015-08-14 | Paper |
| Quantitative stochastic parity games | 2015-08-03 | Paper |
Looking at mean-payoff and total-payoff through windows
Information and Computation | 2015-06-01 | Paper |
Qualitative analysis of concurrent mean-payoff games
Information and Computation | 2015-06-01 | Paper |
POMDPs under probabilistic semantics
Artificial Intelligence | 2015-05-15 | Paper |
The complexity of multi-mean-payoff and multi-energy games
Information and Computation | 2015-05-04 | Paper |
Evolutionary dynamics of biological auctions
Theoretical Population Biology | 2015-03-13 | Paper |
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
Theoretical Computer Science | 2015-02-24 | Paper |
Polynomial-time algorithms for energy games with special weight structures
Algorithmica | 2015-01-19 | Paper |
Doomsday equilibria for omega-regular games
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Partial-observation stochastic reachability and parity games
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Probabilistic opacity for Markov decision processes
Information Processing Letters | 2014-10-07 | Paper |
Qualitative concurrent parity games: bounded rationality
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
Journal of the ACM | 2014-09-12 | Paper |
Approximating the minimum cycle mean
Theoretical Computer Science | 2014-07-25 | Paper |
Partial-observation stochastic games, how to win when belief fails
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Looking at mean-payoff and total-payoff through windows
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Synthesizing robust systems
Acta Informatica | 2014-07-03 | Paper |
Strategy synthesis for multi-dimensional quantitative objectives
Acta Informatica | 2014-07-03 | Paper |
Games with a Weak Adversary
Automata, Languages, and Programming | 2014-07-01 | Paper |
The complexity of ergodic mean-payoff games
Automata, Languages, and Programming | 2014-07-01 | Paper |
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design | 2014-06-30 | Paper |
A survey of partial-observation stochastic parity games
Formal Methods in System Design | 2014-06-30 | Paper |
Code aware resource management
Formal Methods in System Design | 2014-06-30 | Paper |
The complexity of partial-observation stochastic parity games with finite-memory strategies
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Perfect-information stochastic mean-payoff parity games
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Markov decision processes with multiple long-run average objectives
Logical Methods in Computer Science | 2014-03-24 | Paper |
Multi-objective discounted reward verification in graphs and MDPs
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Information and Computation | 2013-12-19 | Paper |
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The complexity of coverage
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Strategy improvement for concurrent reachability and turn-based stochastic safety games
Journal of Computer and System Sciences | 2013-07-24 | Paper |
How to travel between languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Faster algorithms for alternating refinement relations
(available as arXiv preprint) | 2012-11-22 | Paper |
Equivalence of games with probabilistic uncertainty and partial-observation games
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Energy parity games
Theoretical Computer Science | 2012-11-08 | Paper |
| Algorithms for Game Metrics | 2012-10-19 | Paper |
Polynomial-time algorithms for energy games with special weight structures
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Strategy synthesis for multi-dimensional quantitative objectives
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Discounting and averaging in games across time scales
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
| Generalized mean-payoff and energy games | 2012-08-29 | Paper |
Generalized mean-payoff and energy games
(available as arXiv preprint) | 2012-08-29 | Paper |
Robustness of structurally equivalent concurrent parity games
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Synthesizing protocols for digital contract signing
Lecture Notes in Computer Science | 2012-06-15 | Paper |
The complexity of stochastic Müller games
Information and Computation | 2012-05-24 | Paper |
A survey of stochastic \(\omega \)-regular games
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Timed Parity Games: Complexity and Robustness
Logical Methods in Computer Science | 2012-04-02 | Paper |
Minimum Attention Controller Synthesis for Omega-Regular Objectives
Lecture Notes in Computer Science | 2011-10-07 | Paper |
On memoryless quantitative objectives
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Energy and Mean-Payoff Parity Markov Decision Processes
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Finitary languages
Language and Automata Theory and Applications | 2011-06-03 | Paper |
The complexity of request-response games
Language and Automata Theory and Applications | 2011-06-03 | Paper |
QUASY: quantitative synthesis tool
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
The complexity of partial-observation parity games
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Strategy construction for parity games with imperfect information
Information and Computation | 2010-10-07 | Paper |
Probabilistic automata on infinite words: decidability and undecidability results
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Expressiveness and closure properties for quantitative languages
Logical Methods in Computer Science | 2010-09-21 | Paper |
Algorithms for game metrics
Logical Methods in Computer Science | 2010-09-21 | Paper |
Energy parity games
Automata, Languages and Programming | 2010-09-07 | Paper |
Randomness for free
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Qualitative analysis of partially-observable Markov decision processes
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Mean-payoff automaton expressions
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Obliging games
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
The complexity of quantitative concurrent parity games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Strategy logic
Information and Computation | 2010-06-25 | Paper |
Reduction of stochastic parity to stochastic mean-payoff games
Information Processing Letters | 2010-04-19 | Paper |
Probabilistic Systems with LimSup and LimInf Objectives
Infinity in Logic and Computation | 2009-11-12 | Paper |
Probabilistic Weighted Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Alternating Weighted Automata
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Stochastic Games with Finitary Objectives
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
The power of first-order quantification over states in branching and linear time temporal logics
Information Processing Letters | 2009-07-21 | Paper |
A Survey of Stochastic Games with Limsup and Liminf Objectives
Automata, Languages and Programming | 2009-07-14 | Paper |
Better Quality in Synthesis through Quantitative Objectives
Computer Aided Verification | 2009-06-30 | Paper |
Qualitative Logics and Equivalences for Probabilistic Systems
Logical Methods in Computer Science | 2009-06-30 | Paper |
Algorithms for Omega-Regular Games with Imperfect Information
Computer Science Logic | 2009-03-12 | Paper |
Nash Equilibrium for Upward-Closed Objectives
Computer Science Logic | 2009-03-12 | Paper |
Concurrent Games with Tail Objectives
Computer Science Logic | 2009-03-12 | Paper |
Timed Parity Games: Complexity and Robustness
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Environment Assumptions for Synthesis
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Strategy Construction for Parity Games with Imperfect Information
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Quantitative Languages
Computer Science Logic | 2008-11-20 | Paper |
Strategy Logic
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Trading Infinite Memory for Uniform Randomness in Timed Games
Hybrid Systems: Computation and Control | 2008-09-02 | Paper |
Controller Synthesis with Budget Constraints
Hybrid Systems: Computation and Control | 2008-09-02 | Paper |
Stochastic limit-average games are in EXPTIME
International Journal of Game Theory | 2008-07-25 | Paper |
Value Iteration
25 Years of Model Checking | 2008-07-15 | Paper |
Markov Decision Processes with Multiple Long-Run Average Objectives
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Stochastic Müller Games are PSPACE-Complete
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Model-Checking ω-Regular Properties of Interval Markov Chains
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Markov Decision Processes with Multiple Objectives
STACS 2006 | 2008-03-19 | Paper |
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
STACS 2006 | 2008-03-19 | Paper |
Concurrent games with tail objectives
Theoretical Computer Science | 2007-12-18 | Paper |
Algorithms for Omega-Regular Games with Imperfect Information
Logical Methods in Computer Science | 2007-11-15 | Paper |
Optimal Strategy Synthesis in Stochastic Müller Games
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Generalized Parity Games
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Strategy Improvement for Stochastic Rabin and Streett Games
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Assume-Guarantee Synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Games with secure equilibria
Theoretical Computer Science | 2006-12-07 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Methods for Components and Objects
Lecture Notes in Computer Science | 2006-11-01 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Stack size analysis for interrupt-driven programs
Information and Computation | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2090843 (Why is no real title available?) | 2004-08-13 | Paper |
A branching time temporal framework for quantitative reasoning
Journal of Automated Reasoning | 2003-06-09 | Paper |
