Laurent Doyen

According to our database1, Laurent Doyen authored at least 67 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Observation and Distinction. Representing Information in Infinite Games.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
The complexity of synchronizing Markov decision processes.
J. Comput. Syst. Sci., 2019

Graph Planning with Expected Finite Horizon.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Verification of Hybrid Systems.
Proceedings of the Handbook of Model Checking., 2018

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

The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract).
Proceedings of the Reachability Problems - 11th International Workshop, 2017

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

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

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

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

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

Randomness for free.
Inf. Comput., 2015

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

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

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

Synchronizing Words for Weighted and Timed Automata.
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.
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

Limit Synchronization in Markov Decision Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Robust Synchronization in Markov Decision Processes.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
A survey of partial-observation stochastic parity games.
Formal Methods Syst. Des., 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
Proceedings of the Automated Technology for Verification and Analysis, 2013

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

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
CoRR, 2012

Infinite Synchronizing Words for Probabilistic Automata (Erratum)
CoRR, 2012

2011
Faster algorithms for mean-payoff games.
Formal Methods Syst. Des., 2011

Synchronizing Objectives for Markov Decision Processes
Proceedings of the Proceedings International Workshop on Interactions, Games and Protocols, 2011

Infinite Synchronizing Words for Probabilistic Automata.
Proceedings of the Mathematical Foundations of Computer Science 2011, 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

On Reachability for Hybrid Automata over Bounded Time.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

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

Antichain-Based QBF Solving.
Proceedings of the Automated Technology for Verification and Analysis, 2011

Games with imperfect information: theory and algorithms.
Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

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

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

Expressiveness and Closure Properties for Quantitative Languages
Log. Methods Comput. Sci., 2010

Antichain Algorithms for Finite Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Qualitative Analysis of Partially-Observable Markov Decision Processes.
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

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

Energy and Mean-Payoff Games with Imperfect Information.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

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

Robustness of Sequential Circuits.
Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009
Antichains for the Automata-Based Approach to Model-Checking
Log. Methods Comput. Sci., 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

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

Realizability of Real-Time Logics.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 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

2008
Equivalence of Labeled Markov Chains.
Int. J. Found. Comput. Sci., 2008

Robust safety of timed automata.
Formal Methods Syst. Des., 2008

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

On the Power of Imperfect Information.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Interface theories with component reuse.
Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

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

Alaska.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
Algorithms for Omega-Regular Games with Imperfect Information.
Log. Methods Comput. Sci., 2007

Robust parametric reachability for timed automata.
Inf. Process. Lett., 2007

Improved Algorithms for the Automata-Based Approach to Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

2006
A Lattice Theory for Solving Games of Imperfect Information.
Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

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

Antichains: A New Algorithm for Checking Universality of Finite Automata.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
Almost ASAP semantics: from timed models to timed implementations.
Formal Asp. Comput., 2005

Automatic Rectangular Refinement of Affine Hybrid Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Systematic Implementation of Real-Time Models.
Proceedings of the FM 2005: Formal Methods, 2005

2004
Robustness and Implementability of Timed Automata.
Proceedings of the Formal Techniques, 2004


  Loading...