Krishnendu Chatterjee

According to our database1, Krishnendu Chatterjee
  • authored at least 345 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Obligation Blackwell Games and P-Automata.
J. Symb. Log., 2017

Hyperplane separation technique for multidimensional mean-payoff games.
J. Comput. Syst. Sci., 2017

Trading performance for stability in Markov decision processes.
J. Comput. Syst. Sci., 2017

The Complexity of Mean-Payoff Pushdown Games.
J. ACM, 2017

Pushdown reachability with constant treewidth.
Inf. Process. Lett., 2017

Quantitative fair simulation games.
Inf. Comput., 2017

Doomsday equilibria for omega-regular games.
Inf. Comput., 2017

Sensor Synthesis for POMDPs with Reachability Objectives.
CoRR, 2017

Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs.
CoRR, 2017

Efficient Algorithms for Checking Fast Termination in VASS.
CoRR, 2017

Faster Algorithms for Weighted Recursive State Machines.
CoRR, 2017

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.
CoRR, 2017

Faster Algorithms for Mean-Payoff Parity Games.
CoRR, 2017

Bidirectional Nested Weighted Automata.
CoRR, 2017

Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.
CoRR, 2017

Non-polynomial Worst-Case Analysis of Recursive Programs.
CoRR, 2017

Termination of Nondeterministic Recursive Probabilistic Programs.
CoRR, 2017

Improved Set-based Symbolic Algorithms for Parity Games.
CoRR, 2017

Value Iteration for Long-run Average Reward in Markov Decision Processes.
CoRR, 2017

Special issue: Synthesis and SYNT 2014.
Acta Inf., 2017

Stochastic invariants for probabilistic termination.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Faster Algorithms for Weighted Recursive State Machines.
Proceedings of the Programming Languages and Systems, 2017

Improved Set-Based Symbolic Algorithms for Parity Games.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Bidirectional Nested Weighted Automata.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Non-polynomial Worst-Case Analysis of Recursive Programs.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Value Iteration for Long-Run Average Reward in Markov Decision Processes.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

The Cost of Exactness in Quantitative Reachability.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

JTDec: A Tool for Tree Decompositions in Soot.
Proceedings of the Automated Technology for Verification and Analysis, 2017

Optimizing Expectation with Guarantees in POMDPs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
What is decidable about partially observable Markov decision processes with ω-regular objectives.
J. Comput. Syst. Sci., 2016

Data-centric Dynamic Partial Order Reduction.
CoRR, 2016

Stochastic Invariants for Probabilistic Termination.
CoRR, 2016

Optimizing Expectation with Guarantees in POMDPs (Technical Report).
CoRR, 2016

Robust Draws in Balanced Knockout Tournaments.
CoRR, 2016

Nested Weighted Limit-Average Automata of Bounded Width.
CoRR, 2016

Quantitative Automata under Probabilistic Semantics.
CoRR, 2016

Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
CoRR, 2016

Termination Analysis of Probabilistic Programs through Positivstellensatz's.
CoRR, 2016

Conditionally Optimal Algorithms for Generalized Büchi Games.
CoRR, 2016

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.
CoRR, 2016

Computation Tree Logic for Synchronization Properties.
CoRR, 2016

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives.
CoRR, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs.
CoRR, 2016

Optimal cost almost-sure reachability in POMDPs.
Artif. Intell., 2016

Quantitative Monitor Automata.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

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

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

Nested Weighted Limit-Average Automata of Bounded Width.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Conditionally Optimal Algorithms for Generalized Büchi Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Quantitative Automata under Probabilistic Semantics.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

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, 2016

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Robust Draws in Balanced Knockout Tournaments.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Computation Tree Logic for Synchronization Properties.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Game-theoretic models identify useful principles for peer collaboration in online learning platforms.
Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing, 2016

Termination Analysis of Probabilistic Programs Through Positivstellensatz's.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Indefinite-Horizon Reachability in Goal-DEC-POMDPs.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives.
Theor. Comput. Sci., 2015

Quantitative Temporal Simulation and Refinement Distances for Timed Systems.
IEEE Trans. Automat. Contr., 2015

Measuring and Synthesizing Systems in Probabilistic Environments.
J. ACM, 2015

Probabilistic opacity for Markov decision processes.
Inf. Process. Lett., 2015

The complexity of multi-mean-payoff and multi-energy games.
Inf. Comput., 2015

Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria.
Inf. Comput., 2015

Qualitative analysis of concurrent mean-payoff games.
Inf. Comput., 2015

Looking at mean-payoff and total-payoff through windows.
Inf. Comput., 2015

Randomness for free.
Inf. Comput., 2015

Evolution of Decisions in Population Games with Sequentially Searching Individuals.
Games, 2015

CEGAR for compositional analysis of qualitative properties in Markov decision processes.
Formal Methods in System Design, 2015

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061).
Dagstuhl Reports, 2015

Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
CoRR, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
CoRR, 2015

Nested Weighted Automata.
CoRR, 2015

Edit Distance for Pushdown Automata.
CoRR, 2015

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives.
CoRR, 2015

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
CoRR, 2015

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.
CoRR, 2015

A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs.
CoRR, 2015

The Complexity of Synthesis from Probabilistic Components.
CoRR, 2015

MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives.
CoRR, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.
CoRR, 2015

POMDPs under probabilistic semantics.
Artif. Intell., 2015

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

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, 2015

Quantitative Interprocedural Analysis.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

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, 2015

Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Nested Weighted Automata.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Improved Algorithms for One-Pair and k-Pair Streett Objectives.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Edit Distance for Pushdown Automata.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

The Complexity of Synthesis from Probabilistic Components.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

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, 2015

Temporal logic motion planning using POMDPs with parity objectives: case study paper.
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Optimal Cost Almost-Sure Reachability in POMDPs.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Partial-Observation Stochastic Games: How to Win when Belief Fails.
ACM Trans. Comput. Log., 2014

Temporal Specifications with Accumulative Values.
ACM Trans. Comput. Log., 2014

Approximating the minimum cycle mean.
Theor. Comput. Sci., 2014

The Time Scale of Evolutionary Innovation.
PLoS Computational Biology, 2014

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.
J. ACM, 2014

Assume-guarantee synthesis for digital contract signing.
Formal Asp. Comput., 2014

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Logical Methods in Computer Science, 2014

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.
CoRR, 2014

Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games.
CoRR, 2014

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks.
CoRR, 2014

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.
CoRR, 2014

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
CoRR, 2014

Qualitative Analysis of Concurrent Mean-payoff Games.
CoRR, 2014

The Complexity of Ergodic Mean-payoff Games.
CoRR, 2014

Improved Algorithms for One-Pair and k-Pair Streett Objectives.
CoRR, 2014

Optimal Cost Almost-sure Reachability in POMDPs.
CoRR, 2014

Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications.
CoRR, 2014

CEGAR for Qualitative Analysis of Probabilistic Systems.
CoRR, 2014

POMDPs under Probabilistic Semantics.
CoRR, 2014

The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies.
CoRR, 2014

Games with a Weak Adversary.
CoRR, 2014

Verification of Markov Decision Processes using Learning Algorithms.
CoRR, 2014

Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information.
CoRR, 2014

Probabilistic Opacity for Markov Decision Processes.
CoRR, 2014

Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.
CoRR, 2014

Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
Algorithmica, 2014

Strategy synthesis for multi-dimensional quantitative objectives.
Acta Inf., 2014

Synthesizing robust systems.
Acta Inf., 2014

Doomsday Equilibria for Omega-Regular Games.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks.
Proceedings of the IEEE 35th IEEE Real-Time Systems Symposium, 2014

Partial-Observation Stochastic Reachability and Parity Games.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Game theoretic secure localization in wireless sensor networks.
Proceedings of the 4th International Conference on the Internet of Things, 2014

The Complexity of Ergodic Mean-payoff Games.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Games with a Weak Adversary.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Edit distance for timed automata.
Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2014

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Perfect-Information Stochastic Mean-Payoff Parity Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Qualitative Concurrent Parity Games: Bounded Rationality.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

CEGAR for Qualitative Analysis of Probabilistic Systems.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Verification of Markov Decision Processes Using Learning Algorithms.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Synthesis of AMBA AHB from formal specification: a case study.
STTT, 2013

Strategy improvement for concurrent reachability and turn-based stochastic safety games.
J. Comput. Syst. Sci., 2013

The Complexity of Coverage.
Int. J. Found. Comput. Sci., 2013

Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems.
Inf. Comput., 2013

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives.
Formal Methods in System Design, 2013

Code aware resource management.
Formal Methods in System Design, 2013

A survey of partial-observation stochastic parity games.
Formal Methods in System Design, 2013

Trading Performance for Stability in Markov Decision Processes
CoRR, 2013

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
CoRR, 2013

Faster Algorithms for Markov Decision Processes with Low Treewidth
CoRR, 2013

TTP: Tool for Tumor Progression
CoRR, 2013

Looking at Mean-Payoff and Total-Payoff through Windows
CoRR, 2013

Infinite-state games with finitary conditions
CoRR, 2013

Approximating the minimum cycle mean.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.
CoRR, 2013

POMDPs under Probabilistic Semantics.
CoRR, 2013

Doomsday Equilibria for Omega-Regular Games.
CoRR, 2013

POMDPs under Probabilistic Semantics.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Multi-objective Discounted Reward Verification in Graphs and MDPs.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Trading Performance for Stability in Markov Decision Processes.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

How to Travel between Languages.
Proceedings of the Language and Automata Theory and Applications, 2013

Quantitative timed simulation functions and refinement metrics for real-time systems.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Automated analysis of real-time scheduling using graph games.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Distributed synthesis for LTL fragments.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Infinite-state games with finitary conditions.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

TTP: Tool for Tumor Progression.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Faster Algorithms for Markov Decision Processes with Low Treewidth.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Looking at Mean-Payoff and Total-Payoff through Windows.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Image Enhancement in Transient Lock-In Thermography Through Time Series Reconstruction and Spatial Slope Correction.
IEEE Trans. Instrumentation and Measurement, 2012

Energy parity games.
Theor. Comput. Sci., 2012

A survey of stochastic ω-regular games.
J. Comput. Syst. Sci., 2012

Discounting and Averaging in Games across Time scales.
Int. J. Found. Comput. Sci., 2012

The complexity of stochastic Müller games.
Inf. Comput., 2012

Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461).
Dagstuhl Reports, 2012

Quantitative Timed Simulation Functions and Refinement Metrics for Timed Systems (Full Version)
CoRR, 2012

Finite-State and Pushdown Games with Multi-dimensional Mean-Payoff Objectives
CoRR, 2012

Strategy complexity of finite-horizon Markov decision processes and simple stochastic games
CoRR, 2012

The Complexity of Multi-Mean-Payoff and Multi-Energy Games
CoRR, 2012

Finite Automata with Time-Delay Blocks (Extended Version)
CoRR, 2012

Counterexample-guided Planning
CoRR, 2012

Obligation Blackwell Games and p-Automata
CoRR, 2012

Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives
CoRR, 2012

Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games
CoRR, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
CoRR, 2012

Strategy Synthesis for Multi-dimensional Quantitative Objectives
CoRR, 2012

Faster Algorithms for Alternating Refinement Relations
CoRR, 2012

Strategy Improvement for Concurrent Reachability and Safety Games
CoRR, 2012

Mean-Payoff Pushdown Games
CoRR, 2012

Synthesizing Protocols for Digital Contract Signing.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

An O(n2) time algorithm for alternating Büchi games.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Mean-Payoff Pushdown Games.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Decidable Problems for Probabilistic Automata on Infinite Words.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Partial-Observation Stochastic Games: How to Win When Belief Fails.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Robustness of Structurally Equivalent Concurrent Parity Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
Proceedings of the Algorithms - ESA 2012, 2012

Finite automata with time-delay blocks.
Proceedings of the 12th International Conference on Embedded Software, 2012

Faster Algorithms for Alternating Refinement Relations.
Proceedings of the Computer Science Logic (CSL'12), 2012

Strategy Synthesis for Multi-Dimensional Quantitative Objectives.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Qualitative concurrent parity games.
ACM Trans. Comput. Log., 2011

An O(n^2) Time Algorithm for Alternating Büchi Games
CoRR, 2011

Bounded Rationality in Concurrent Parity Games
CoRR, 2011

Partial-Observation Stochastic Games: How to Win when Belief Fails
CoRR, 2011

Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-run Average Objectives
CoRR, 2011

Decidable Problems for Probabilistic Automata on Infinite Words
CoRR, 2011

Robustness of Structurally Equivalent Concurrent Parity Games
CoRR, 2011

A reduction from parity games to simple stochastic games
Proceedings of Second International Symposium on Games, 2011

Quantitative Synthesis for Concurrent Programs
CoRR, 2011

Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives
CoRR, 2011

On Memoryless Quantitative Objectives
CoRR, 2011

Energy and Mean-Payoff Parity Markov Decision Processes
CoRR, 2011

The Decidability Frontier for Probabilistic Automata on Infinite Words
CoRR, 2011

Synthesis of Memory-Efficient Real-Time Controllers for Safety Objectives (Full Version)
CoRR, 2011

Finitary languages
CoRR, 2011

Timed Parity Games: Complexity and Robustness
Logical Methods in Computer Science, 2011

QUASY: Quantitative Synthesis Tool.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Specification-centered robustness.
Proceedings of the Industrial Embedded Systems (SIES), 2011

Graph Games with Reachability Objectives - (Invited Talk).
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Energy and Mean-Payoff Parity Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Temporal Specifications with Accumulative Values.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

The Complexity of Request-Response Games.
Proceedings of the Language and Automata Theory and Applications, 2011

Finitary Languages.
Proceedings of the Language and Automata Theory and Applications, 2011

Synthesis of memory-efficient "real-time" controllers for safety objectives.
Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Minimum Attention Controller Synthesis for Omega-Regular Objectives.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

On Memoryless Quantitative Objectives.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

The Complexity of Quantitative Information Flow Problems.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Quantitative Synthesis for Concurrent Programs.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Quantitative languages.
ACM Trans. Comput. Log., 2010

Strategy logic.
Inf. Comput., 2010

Strategy construction for parity games with imperfect information.
Inf. Comput., 2010

Expressiveness and Closure Properties for Quantitative Languages
Logical Methods in Computer Science, 2010

Generalized Mean-payoff and Energy Games
CoRR, 2010

Mean-payoff Automaton Expressions
CoRR, 2010

Discounting in Games across Time Scales
Proceedings of the Proceedings First Symposium on Games, 2010

Randomness for Free
CoRR, 2010

Assume-Guarantee Synthesis for Digital Contract Signing
CoRR, 2010

GIST: A Solver for Probabilistic Games
CoRR, 2010

Measuring and Synthesizing Systems in Probabilistic Environments
CoRR, 2010

Energy Parity Games
CoRR, 2010

Synthesis of AMBA AHB from Formal Specification
CoRR, 2010

Algorithms for Game Metrics (Full Version)
Logical Methods in Computer Science, 2010

Qualitative Analysis of Partially-Observable Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Randomness for Free.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Complexity of Partial-Observation Parity Games.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Energy Parity Games.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Generalized Mean-payoff and Energy Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Analyzing the Impact of Change in Multi-threaded Programs.
Proceedings of the Fundamental Approaches to Software Engineering, 2010

Obliging Games.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Mean-Payoff Automaton Expressions.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Measuring and Synthesizing Systems in Probabilistic Environments.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Gist: A Solver for Probabilistic Games.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Robustness in the Presence of Liveness.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Probabilistic Automata on Infinite Words: Decidability and Undecidability Results.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
Finitary winning in omega-regular games.
ACM Trans. Comput. Log., 2009

Probabilistic Weighted Automata
CoRR, 2009

Qualitative Analysis of Partially-observable Markov Decision Processes
CoRR, 2009

Expressiveness and Closure Properties for Quantitative Languages
CoRR, 2009

Better Quality in Synthesis through Quantitative Objectives
CoRR, 2009

Qualitative Logics and Equivalences for Probabilistic Systems
Logical Methods in Computer Science, 2009

Alpaga: A Tool for Solving Parity Games with Imperfect Information
CoRR, 2009

Alpaga: A Tool for Solving Parity Games with Imperfect Information.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

Termination criteria for solving concurrent safety and reachability games.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Stochastic Games with Finitary Objectives.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Expressiveness and Closure Properties for Quantitative Languages.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

A Survey of Stochastic Games with Limsup and Liminf Objectives.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Alternating Weighted Automata.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Probabilistic Weighted Automata.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Better Quality in Synthesis through Quantitative Objectives.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Reduction of stochastic parity to stochastic mean-payoff games.
Inf. Process. Lett., 2008

Stochastic limit-average games are in EXPTIME.
Int. J. Game Theory, 2008

Termination Criteria for Solving Concurrent Safety and Reachability Games
CoRR, 2008

Probabilistic Systems with LimSup and LimInf Objectives
CoRR, 2008

Timed Parity Games: Complexity and Robustness
CoRR, 2008

Environment Assumptions for Synthesis
CoRR, 2008

Stochastic Limit-Average Games are in EXPTIME
CoRR, 2008

Algorithms for Büchi Games
CoRR, 2008

Linear Time Algorithm for Weak Parity Games
CoRR, 2008

Strategy Improvement for Concurrent Safety Games
CoRR, 2008

The Complexity of Coverage
CoRR, 2008

Assigning trust to Wikipedia content.
Proceedings of the 2008 International Symposium on Wikis, 2008

Value Iteration.
Proceedings of the 25 Years of Model Checking - History, Achievements, Perspectives, 2008

Controller Synthesis with Budget Constraints.
Proceedings of the Hybrid Systems: Computation and Control, 11th International Workshop, 2008

Trading Infinite Memory for Uniform Randomness in Timed Games.
Proceedings of the Hybrid Systems: Computation and Control, 11th International Workshop, 2008

Algorithms for Game Metrics.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Model-Checking omega-Regular Properties of Interval Markov Chains.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Timed Parity Games: Complexity and Robustness.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Logical Reliability of Interacting Real-Time Tasks.
Proceedings of the Design, Automation and Test in Europe, 2008

Quantitative Languages.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Environment Assumptions for Synthesis.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Strategy Construction for Parity Games with Imperfect Information.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Robust content-driven reputation.
Proceedings of the 1st ACM Workshop on Security and Artificial Intelligence, 2008

The Complexity of Coverage.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
Concurrent games with tail objectives.
Theor. Comput. Sci., 2007

Algorithms for Omega-Regular Games with Imperfect Information.
Logical Methods in Computer Science, 2007

Algorithms for Omega-Regular Games with Imperfect Information
CoRR, 2007

Assume-Guarantee Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Qualitative Logics and Equivalences for Probabilistic Systems.
Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

Probabilistic Systems with LimSup and LimInf Objectives.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

Markov Decision Processes with Multiple Long-Run Average Objectives.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Stochastic Müller Games are PSPACE-Complete.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Generalized Parity Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Optimal Strategy Synthesis in Stochastic Müller Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Strategy Logic.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Games with secure equilibria.
Theor. Comput. Sci., 2006

Finitary Winning in omega-Regular Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Markov Decision Processes with Multiple Objectives.
Proceedings of the STACS 2006, 2006

Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.
Proceedings of the STACS 2006, 2006

The complexity of quantitative concurrent parity games.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Strategy Improvement for Concurrent Reachability Games.
Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

Compositional Quantitative Reasoning.
Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

Algorithms for Omega-Regular Games with Imperfect Information, .
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Nash Equilibrium for Upward-Closed Objectives.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Concurrent Games with Tail Objectives.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Games for Controls.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

Strategy Improvement for Stochastic Rabin and Streett Games.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Counterexample-guided Planning.
Proceedings of the UAI '05, 2005

Mean-Payoff Parity Games.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

The Complexity of Stochastic Rabin and Streett Games'.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Semiperfect-Information Games.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Two-Player Nonzero-Sum omega-Regular Games.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Verifying Quantitative Properties Using Bound Functions.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

2004
The power of first-order quantification over states in branching and linear time temporal logics.
Inf. Process. Lett., 2004

Stack size analysis for interrupt-driven programs.
Inf. Comput., 2004

Quantitative stochastic parity games.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Trading Memory for Randomness.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Games with Secure Equilibria.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures.
Proceedings of the Distributed Computing, 2004

Games with Secure Equilibria.
Proceedings of the Formal Methods for Components and Objects, 2004

On Nash Equilibria in Stochastic Games.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
A Branching Time Temporal Framework for Quantitative Reasoning.
J. Autom. Reasoning, 2003

Stack Size Analysis for Interrupt-Driven Programs.
Proceedings of the Static Analysis, 10th International Symposium, 2003

Simple Stochastic Parity Games.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003


  Loading...