Laurent Doyen

Inf. Process. Lett., 2025

2024

Stochastic Processes with Expected Stopping Time.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2024

Expectation in Stochastic Window Mean-Payoff Games.

[BibT_eX]

[DOI]

Pranshu Gaba

Shibashis Guha

CoRR, 2024

Stochastic Window Mean-Payoff Games.

[BibT_eX]

[DOI]

Pranshu Gaba

Shibashis Guha

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

Regular Games with Imperfect Information Are Not That Regular.

[BibT_eX]

[DOI]

Thomas Soullard

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Stochastic Games with Synchronization Objectives.

[BibT_eX]

[DOI]

J. ACM, June, 2023

Observation and Distinction: Representing Information in Infinite Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., February, 2023

Synthesising Full-Information Protocols.

[BibT_eX]

[DOI]

Thomas Soullard

CoRR, 2023

2022

Graph planning with expected finite horizon.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Stochastic Games with Synchronizing Objectives.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Bounds for Synchronizing Markov Decision Processes.

[BibT_eX]

[DOI]

Marie van den Bogaard

Proceedings of the Computer Science - Theory and Applications, 2022

2019

The complexity of synchronizing Markov decision processes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

2018

Verification of Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Model Checking., 2018

2017

Doomsday equilibria for omega-regular games.

[BibT_eX]

[DOI]

Emmanuel Filiot

Inf. Comput., 2017

The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 11th International Workshop, 2017

The Cost of Exactness in Quantitative Reachability.

[BibT_eX]

[DOI]

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

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

Computation Tree Logic for Synchronization Properties.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

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

[BibT_eX]

[DOI]

Yaron Velner

Alexander Moshe Rabinovich

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

The Complexity of Synthesis from Probabilistic Components.

[BibT_eX]

[DOI]

Moshe Y. Vardi

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

2014

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

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Games with a Weak Adversary.

[BibT_eX]

[DOI]

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

Synchronizing Words for Weighted and Timed Automata.

[BibT_eX]

[DOI]

Line Juhl

Kim Guldstrand Larsen

Nicolas Markey

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 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

Limit Synchronization in Markov Decision Processes.

[BibT_eX]

[DOI]

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

Robust Synchronization in Markov Decision Processes.

[BibT_eX]

[DOI]

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

2013

A survey of partial-observation stochastic parity games.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Energy parity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints

[BibT_eX]

[DOI]

CoRR, 2012

Infinite Synchronizing Words for Probabilistic Automata (Erratum)

[BibT_eX]

[DOI]

CoRR, 2012

2011

Faster algorithms for mean-payoff games.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2011

Synchronizing Objectives for Markov Decision Processes

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Interactions, Games and Protocols, 2011

Infinite Synchronizing Words for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 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

On Reachability for Hybrid Automata over Bounded Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On Memoryless Quantitative Objectives.

[BibT_eX]

[DOI]

Rohit Singh

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

Antichain-Based QBF Solving.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2011

Games with imperfect information: theory and algorithms.

[BibT_eX]

Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

2010

Quantitative languages.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2010

Strategy construction for parity games with imperfect information.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Expressiveness and Closure Properties for Quantitative Languages

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Antichain Algorithms for Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 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

Energy and Mean-Payoff Games with Imperfect Information.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Mean-Payoff Automaton Expressions.

[BibT_eX]

[DOI]

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

Robustness of Sequential Circuits.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009

Antichains for the Automata-Based Approach to Model-Checking

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 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

Realizability of Real-Time Logics.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 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

2008

Equivalence of Labeled Markov Chains.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Robust safety of timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2008

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.

[BibT_eX]

[DOI]

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

On the Power of Imperfect Information.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Interface theories with component reuse.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

Strategy Construction for Parity Games with Imperfect Information.

[BibT_eX]

[DOI]

Sangram Raje

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

Alaska.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Algorithms for Omega-Regular Games with Imperfect Information.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Robust parametric reachability for timed automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Improved Algorithms for the Automata-Based Approach to Model-Checking.

[BibT_eX]

[DOI]

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

2006

A Lattice Theory for Solving Games of Imperfect Information.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

Algorithms for Omega-Regular Games with Imperfect Information<sup>, </sup>.

[BibT_eX]

[DOI]

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

Antichains: A New Algorithm for Checking Universality of Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

Almost ASAP semantics: from timed models to timed implementations.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2005

Automatic Rectangular Refinement of Affine Hybrid Systems.

[BibT_eX]

[DOI]

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

Systematic Implementation of Real-Time Models.

[BibT_eX]

[DOI]