Krishnendu Chatterjee

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Computational Approaches for Stochastic Shortest Path on Succinct MDPs.

[BibT_eX]

[DOI]

Nastaran Okati

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives.

[BibT_eX]

[DOI]

Adrián Elgyütt

Owen Rouillé

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Quantitative Analysis of Smart Contracts.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2018

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives.

[BibT_eX]

[DOI]

Simin Oraee

Viktor Toman

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Computing Average Response Time.

[BibT_eX]

[DOI]

Proceedings of the Principles of Modeling, 2018

New Approaches for Almost-Sure Termination of Probabilistic Programs.

[BibT_eX]

[DOI]

Mingzhang Huang

Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

Sensor Synthesis for POMDPs with Reachability Objectives.

[BibT_eX]

[DOI]

Ufuk Topcu

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017

Nested Weighted Automata.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

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

[BibT_eX]

[DOI]

Zuzana Kretínská

Log. Methods Comput. Sci., 2017

Improved Algorithms for Parity and Streett objectives.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Edit Distance for Pushdown Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Obligation Blackwell Games and P-Automata.

[BibT_eX]

[DOI]

J. Symb. Log., 2017

Hyperplane separation technique for multidimensional mean-payoff games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Trading performance for stability in Markov decision processes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

The Complexity of Mean-Payoff Pushdown Games.

[BibT_eX]

[DOI]

J. ACM, 2017

Pushdown reachability with constant treewidth.

[BibT_eX]

[DOI]

Georg Osang

Inf. Process. Lett., 2017

Quantitative fair simulation games.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Doomsday equilibria for omega-regular games.

[BibT_eX]

[DOI]

Emmanuel Filiot

Inf. Comput., 2017

Efficient Algorithms for Checking Fast Termination in VASS.

[BibT_eX]

[DOI]

Dominik Velan

CoRR, 2017

Termination of Nondeterministic Recursive Probabilistic Programs.

[BibT_eX]

[DOI]

CoRR, 2017

Special issue: Synthesis and SYNT 2014.

[BibT_eX]

[DOI]

Rüdiger Ehlers

Acta Informatica, 2017

Stochastic invariants for probabilistic termination.

[BibT_eX]

[DOI]

Dorde Zikelic

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

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

[BibT_eX]

[DOI]

Martin A. Nowak

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Faster Algorithms for Mean-Payoff Parity Games.

[BibT_eX]

[DOI]

Alexander Svozil

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Strategy Complexity of Concurrent Safety Games.

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Faster Algorithms for Weighted Recursive State Machines.

[BibT_eX]

[DOI]

Bernhard Kragl

Samarth Mishra

Proceedings of the Programming Languages and Systems, 2017

Improved Set-Based Symbolic Algorithms for Parity Games.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Bidirectional Nested Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.

[BibT_eX]

[DOI]

Aniket Murhekar

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Value Iteration for Long-Run Average Reward in Markov Decision Processes.

[BibT_eX]

[DOI]

Pranav Ashok

Przemyslaw Daca

Tobias Meggendorfer

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

The Cost of Exactness in Quantitative Reachability.

[BibT_eX]

[DOI]

Proceedings of the Models, Algorithms, Logics and Tools, 2017

JTDec: A Tool for Tree Decompositions in Soot.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2017

Optimizing Expectation with Guarantees in POMDPs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

What is decidable about partially observable Markov decision processes with ω-regular objectives.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Data-centric Dynamic Partial Order Reduction.

[BibT_eX]

[DOI]

Nishant Sinha

Kapil Vaidya

CoRR, 2016

Optimizing Expectation with Guarantees in POMDPs (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs.

[BibT_eX]

[DOI]

Anchit Gupta

CoRR, 2016

Optimal cost almost-sure reachability in POMDPs.

[BibT_eX]

[DOI]

Raghav Gupta

Ayush Kanodia

Artif. Intell., 2016

Quantitative Monitor Automata.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 23rd International Symposium, 2016

Nested Weighted Limit-Average Automata of Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Conditionally Optimal Algorithms for Generalized Büchi Games.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

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

[BibT_eX]

[DOI]

Wolfgang Dvorák

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Robust Draws in Balanced Knockout Tournaments.

[BibT_eX]

[DOI]

Josef Tkadlec

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Computation Tree Logic for Synchronization Properties.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Vineet Pandey

Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing, 2016

Termination Analysis of Probabilistic Programs Through Positivstellensatz's.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract).

[BibT_eX]

[DOI]

Anchit Gupta

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Indefinite-Horizon Reachability in Goal-DEC-POMDPs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jessica Davies

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.

[BibT_eX]

[DOI]

Manas Joglekar

Nisarg Shah

Theor. Comput. Sci., 2015

Quantitative Temporal Simulation and Refinement Distances for Timed Systems.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2015

Measuring and Synthesizing Systems in Probabilistic Environments.

[BibT_eX]

[DOI]

J. ACM, 2015

Probabilistic opacity for Markov decision processes.

[BibT_eX]

[DOI]

Béatrice Bérard

Nathalie Sznajder

Inf. Process. Lett., 2015

The complexity of multi-mean-payoff and multi-energy games.

[BibT_eX]

[DOI]

Alexander Moshe Rabinovich

Inf. Comput., 2015

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

[BibT_eX]

[DOI]

Jirí Sgall

Inf. Comput., 2015

Qualitative analysis of concurrent mean-payoff games.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Looking at mean-payoff and total-payoff through windows.

[BibT_eX]

[DOI]

Mickael Randour

Inf. Comput., 2015

Randomness for free.

[BibT_eX]

[DOI]

Hugo Gimbert

Inf. Comput., 2015

Evolution of Decisions in Population Games with Sequentially Searching Individuals.

[BibT_eX]

[DOI]

Tadeas Priklopil

Games, 2015

CEGAR for compositional analysis of qualitative properties in Markov decision processes.

[BibT_eX]

[DOI]

Przemyslaw Daca

Formal Methods Syst. Des., 2015

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

[BibT_eX]

[DOI]

Stéphane Lafortune

Nicolas Markey

Wolfgang Thomas

Dagstuhl Reports, 2015

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

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

CoRR, 2015

POMDPs under probabilistic semantics.

[BibT_eX]

[DOI]

Artif. Intell., 2015

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

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

[BibT_eX]

[DOI]

Swen Jacobs

Robert Könighofer

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Quantitative Interprocedural Analysis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Prateesh Goyal

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

Improved Algorithms for One-Pair and k-Pair Streett Objectives.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Raghav Gupta

Ayush Kanodia

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

The Complexity of Synthesis from Probabilistic Components.

[BibT_eX]

[DOI]

Moshe Y. Vardi

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games.

[BibT_eX]

[DOI]

María Svorenová

Ivana Cerná

Calin Belta

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.

[BibT_eX]

[DOI]

Ivana Cerná

Calin Belta

Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.

[BibT_eX]

[DOI]

Andreas Fellner

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

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

[BibT_eX]

[DOI]

Umair Z. Ahmed

Sumit Gulwani

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Partial-Observation Stochastic Games: How to Win when Belief Fails.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Temporal Specifications with Accumulative Values.

[BibT_eX]

[DOI]

Udi Boker

Orna Kupferman

ACM Trans. Comput. Log., 2014

Approximating the minimum cycle mean.

[BibT_eX]

[DOI]

Sebastian Krinninger

Michael A. Raskin

Theor. Comput. Sci., 2014

The Time Scale of Evolutionary Innovation.

[BibT_eX]

[DOI]

Ben Adlam

Martin A. Nowak

PLoS Comput. Biol., 2014

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

[BibT_eX]

[DOI]

J. ACM, 2014

Assume-guarantee synthesis for digital contract signing.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2014

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

[BibT_eX]

[DOI]

Václav Brozek

Log. Methods Comput. Sci., 2014

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.

[BibT_eX]

[DOI]

Alexander Zimin

CoRR, 2014

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

[BibT_eX]

[DOI]

Prateesh Goyal

CoRR, 2014

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

[BibT_eX]

[DOI]

Sebastian Krinninger

Danupon Nanongkai

Algorithmica, 2014

Strategy synthesis for multi-dimensional quantitative objectives.

[BibT_eX]

[DOI]

Mickael Randour

Acta Informatica, 2014

Synthesizing robust systems.

[BibT_eX]

[DOI]

Acta Informatica, 2014

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

[BibT_eX]

[DOI]

Alexander Kößler

Ulrich Schmid

Proceedings of the IEEE 35th IEEE Real-Time Systems Symposium, 2014

Partial-Observation Stochastic Reachability and Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Game theoretic secure localization in wireless sensor networks.

[BibT_eX]

[DOI]

Susmit Jha

Stavros Tripakis

Sanjit A. Seshia

Proceedings of the 4th International Conference on the Internet of Things, 2014

The Complexity of Ergodic Mean-payoff Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Games with a Weak Adversary.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Edit distance for timed automata.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Sumit Nain

Moshe Y. Vardi

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Perfect-Information Stochastic Mean-Payoff Parity Games.

[BibT_eX]

[DOI]

Hugo Gimbert

Youssouf Oualhadj

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Qualitative Concurrent Parity Games: Bounded Rationality.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

CEGAR for Qualitative Analysis of Probabilistic Systems.

[BibT_eX]

[DOI]

Przemyslaw Daca

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Verification of Markov Decision Processes Using Learning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

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

[BibT_eX]

[DOI]

Yashdeep Godhal

Int. J. Softw. Tools Technol. Transf., 2013

Strategy improvement for concurrent reachability and turn-based stochastic safety games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

The Complexity of Coverage.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

Inf. Comput., 2013

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives.

[BibT_eX]

[DOI]

Manas Joglekar

Nisarg Shah

Formal Methods Syst. Des., 2013

Code aware resource management.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

A survey of partial-observation stochastic parity games.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

Approximating the minimum cycle mean.

[BibT_eX]

[DOI]

Sebastian Krinninger

Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Multi-objective Discounted Reward Verification in Graphs and MDPs.

[BibT_eX]

[DOI]

Dominik Wojtczak

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

How to Travel between Languages.

[BibT_eX]

[DOI]

Siddhesh Chaubal

Sasha Rubin

Proceedings of the Language and Automata Theory and Applications, 2013

Quantitative timed simulation functions and refinement metrics for real-time systems.

[BibT_eX]

[DOI]

Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Automated analysis of real-time scheduling using graph games.

[BibT_eX]

[DOI]

Alexander Kößler

Ulrich Schmid

Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Distributed synthesis for LTL fragments.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2013

Infinite-state games with finitary conditions.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

TTP: Tool for Tumor Progression.

[BibT_eX]

[DOI]

Johannes G. Reiter

Ivana Bozic

Martin A. Nowak

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Faster Algorithms for Markov Decision Processes with Low Treewidth.

[BibT_eX]

[DOI]

Jakub Lacki

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.

[BibT_eX]

[DOI]

Andreas Gaiser

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Image Enhancement in Transient Lock-In Thermography Through Time Series Reconstruction and Spatial Slope Correction.

[BibT_eX]

[DOI]

Suneet Tuli

IEEE Trans. Instrum. Meas., 2012

Energy parity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A survey of stochastic ω-regular games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Discounting and Averaging in Games across Time scales.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

The complexity of stochastic Müller games.

[BibT_eX]

[DOI]

Inf. Comput., 2012

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

[BibT_eX]

[DOI]

Nikolaj S. Bjørner

Laura Kovács

Dagstuhl Reports, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Finite Automata with Time-Delay Blocks (Extended Version)

[BibT_eX]

[DOI]

CoRR, 2012

Strategy Improvement for Concurrent Reachability and Safety Games

[BibT_eX]

[DOI]

CoRR, 2012

Synthesizing Protocols for Digital Contract Signing.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

An O(n2) time algorithm for alternating Büchi games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Mean-Payoff Pushdown Games.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Decidable Problems for Probabilistic Automata on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Robustness of Structurally Equivalent Concurrent Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Finite automata with time-delay blocks.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Embedded Software, 2012

Faster Algorithms for Alternating Refinement Relations.

[BibT_eX]

[DOI]

Siddhesh Chaubal

Pritish Kamath

Proceedings of the Computer Science Logic (CSL'12), 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Qualitative concurrent parity games.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Bounded Rationality in Concurrent Parity Games

[BibT_eX]

[DOI]

CoRR, 2011

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

[BibT_eX]

[DOI]

Pritam Roy

CoRR, 2011

A reduction from parity games to simple stochastic games

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Proceedings of Second International Symposium on Games, 2011

The Decidability Frontier for Probabilistic Automata on Infinite Words

[BibT_eX]

[DOI]

CoRR, 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Timed Parity Games: Complexity and Robustness

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

QUASY: Quantitative Synthesis Tool.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Specification-centered robustness.

[BibT_eX]

[DOI]

Karin Greimel

Proceedings of the Industrial Embedded Systems (SIES), 2011

Graph Games with Reachability Objectives - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 5th International Workshop, 2011

Energy and Mean-Payoff Parity Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives.

[BibT_eX]

[DOI]

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

The Complexity of Request-Response Games.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Finitary Languages.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Proceedings of the Language and Automata Theory and Applications, 2011

Synthesis of memory-efficient "real-time" controllers for safety objectives.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Minimum Attention Controller Synthesis for Omega-Regular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

On Memoryless Quantitative Objectives.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

The Complexity of Quantitative Information Flow Problems.

[BibT_eX]

[DOI]

Pavol Cerný

Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

Quantitative Synthesis for Concurrent Programs.

[BibT_eX]

[DOI]

Pavol Cerný

Arjun Radhakrishna

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010

Quantitative languages.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2010

Strategy logic.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Strategy construction for parity games with imperfect information.

[BibT_eX]

[DOI]

Dietmar Berwanger

Martin De Wulf

Inf. Comput., 2010

Expressiveness and Closure Properties for Quantitative Languages

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Discounting in Games across Time Scales

[BibT_eX]

[DOI]

Proceedings of the Proceedings First Symposium on Games, 2010

Synthesis of AMBA AHB from Formal Specification

[BibT_eX]

[DOI]

Yashdeep Godhal

CoRR, 2010

Algorithms for Game Metrics (Full Version)

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Qualitative Analysis of Partially-Observable Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Complexity of Partial-Observation Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Generalized Mean-payoff and Energy Games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

César Sánchez

Proceedings of the Fundamental Approaches to Software Engineering, 2010

Obliging Games.

[BibT_eX]

[DOI]

Christof Löding

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

Mean-Payoff Automaton Expressions.

[BibT_eX]

[DOI]

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

Gist: A Solver for Probabilistic Games.

[BibT_eX]

[DOI]

Arjun Radhakrishna

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Robustness in the Presence of Liveness.

[BibT_eX]

[DOI]

Karin Greimel

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Probabilistic Automata on Infinite Words: Decidability and Undecidability Results.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2010

2009

Finitary winning in omega-regular games.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Qualitative Logics and Equivalences for Probabilistic Systems

[BibT_eX]

[DOI]

Marco Faella

Axel Legay

Log. Methods Comput. Sci., 2009

Alpaga: A Tool for Solving Parity Games with Imperfect Information.

[BibT_eX]

[DOI]

Dietmar Berwanger

Martin De Wulf

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

Termination criteria for solving concurrent safety and reachability games.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Stochastic Games with Finitary Objectives.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

A Survey of Stochastic Games with Limsup and Liminf Objectives.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Alternating Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Probabilistic Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Better Quality in Synthesis through Quantitative Objectives.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008

Reduction of stochastic parity to stochastic mean-payoff games.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Stochastic limit-average games are in EXPTIME.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2008

Algorithms for Büchi Games

[BibT_eX]

[DOI]

CoRR, 2008

Linear Time Algorithm for Weak Parity Games

[BibT_eX]

[DOI]

CoRR, 2008

Strategy Improvement for Concurrent Safety Games

[BibT_eX]

[DOI]

CoRR, 2008

Assigning trust to Wikipedia content.

[BibT_eX]

[DOI]

B. Thomas Adler

Proceedings of the 2008 International Symposium on Wikis, 2008

Value Iteration.

[BibT_eX]

[DOI]

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

Controller Synthesis with Budget Constraints.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 11th International Workshop, 2008

Trading Infinite Memory for Uniform Randomness in Timed Games.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 11th International Workshop, 2008

Algorithms for Game Metrics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Koushik Sen

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Logical Reliability of Interacting Real-Time Tasks.

[BibT_eX]

[DOI]

Alberto L. Sangiovanni-Vincentelli

Proceedings of the Design, Automation and Test in Europe, 2008

Environment Assumptions for Synthesis.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Strategy Construction for Parity Games with Imperfect Information.

[BibT_eX]

[DOI]

Dietmar Berwanger

Sangram Raje

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Robust content-driven reputation.

[BibT_eX]

[DOI]

Ian Pye

Proceedings of the 1st ACM Workshop on Security and Artificial Intelligence, 2008

2007

Concurrent games with tail objectives.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Algorithms for Omega-Regular Games with Imperfect Information.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Assume-Guarantee Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Probabilistic Systems with LimSup and LimInf Objectives.

[BibT_eX]

[DOI]

Proceedings of the Infinity in Logic and Computation, International Conference, 2007

Markov Decision Processes with Multiple Long-Run Average Objectives.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Stochastic Müller Games are PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Generalized Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Optimal Strategy Synthesis in Stochastic Müller Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006

Games with secure equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Finitary Winning in omega-Regular Games.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Markov Decision Processes with Multiple Objectives.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

The complexity of quantitative concurrent parity games.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Strategy Improvement for Concurrent Reachability Games.

[BibT_eX]

[DOI]

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

Compositional Quantitative Reasoning.

[BibT_eX]

[DOI]

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

Algorithms for Omega-Regular Games with Imperfect Information, .

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Nash Equilibrium for Upward-Closed Objectives.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Games for Controls.

[BibT_eX]

[DOI]

Radha Jagadeesan

Corin Pitcher

Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

Strategy Improvement for Stochastic Rabin and Streett Games.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

Counterexample-guided Planning.

[BibT_eX]

[DOI]

Ranjit Jhala

Proceedings of the UAI '05, 2005

Mean-Payoff Parity Games.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

The Complexity of Stochastic Rabin and Streett Games'.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Semiperfect-Information Games.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Two-Player Nonzero-Sum omega-Regular Games.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Verifying Quantitative Properties Using Bound Functions.

[BibT_eX]

[DOI]

Arindam Chakrabarti

Orna Kupferman

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.

[BibT_eX]

[DOI]

Pallab Dasgupta

P. P. Chakrabarti

Inf. Process. Lett., 2004

Stack size analysis for interrupt-driven programs.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Quantitative stochastic parity games.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Trading Memory for Randomness.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures.

[BibT_eX]

[DOI]

Pallab Dasgupta

P. P. Chakrabarti

Proceedings of the Distributed Computing, 2004

On Nash Equilibria in Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

A Branching Time Temporal Framework for Quantitative Reasoning.

[BibT_eX]

[DOI]

Pallab Dasgupta

P. P. Chakrabarti

J. Autom. Reason., 2003

Simple Stochastic Parity Games.

[BibT_eX]

[DOI]