Krishnendu Chatterjee and Laurent Doyen.
Partial-Observation Stochastic Games: How to Win when Belief Fails.
ACM Transactions on Computational Logic 15:2, 2014.
[
ps]
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger.
Quantitative Languages.
ACM Transactions on Computational Logic 11:4, 2010.
[
ps]
[
pdf]
Martin De Wulf, Laurent Doyen, Jean-François Raskin.
Almost ASAP semantics: from timed models to timed implementations.
Formal Aspects of Computing 17(3): 319-341, Springer, 2005.
[
ps]
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger.
A Survey of Partial-Observation Stochastic Parity Games.
Formal Methods in System Design 43(2): 268-284, Springer, 2013.
[
ps]
[
pdf]
Luboš Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, and Jean-François Raskin.
Faster Algorithms for Mean-Payoff Games.
Formal Methods in System Design 38(2):97-118, Springer, 2011.
[
ps]
[
pdf]
Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin.
Robust safety of timed automata.
Formal Methods in System Design 33(1-3):45-84, Springer-Verlag, 2008.
[
ps]
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin.
Doomsday Equilibria for Omega-Regular Games. Information and Computation 254, Elsevier, 2017, pp. 296-315.
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, and Thomas A. Henzinger.
Randomness for Free.
Information and Computation 245, Elsevier, 2015, pp. 3-16.
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, and Jean-François Raskin.
Looking at Mean-Payoff and Total-Payoff Through Windows.
Information and Computation 242, Elsevier, 2015, pp. 25-52.
[
pdf]
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and Jean-François Raskin.
The Complexity of Multi-Mean-Payoff and Multi-Energy Games.
Information and Computation 241, Elsevier, 2015, pp. 177-196.
[
ps]
[
pdf]
Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A. Henzinger.
Strategy construction for parity games with imperfect information.
Information and Computation 208:10, Elsevier, 2010, pp. 1206-1220.
[
ps]
[
pdf]
Laurent Doyen.
Top-Down Complementation of Automata on Finite Trees.
Information Processing Letters 187:106499, Elsevier, 2025.
[
pdf]
Laurent Doyen.
Robust parametric reachability for timed automata.
Information Processing Letters 102(5):208-213, Elsevier, 2007.
[
ps]
[
pdf]
Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin.
Equivalence of labeled Markov chains.
International Journal of Foundations of Computer Science 19(3):549-563,
World Scientific, 2008.
[
ps]
[
pdf]
Laurent Doyen.
Stochastic Games with Synchronization Objectives.
Journal of the ACM 70(3), 2023.
[
pdf]
Krishnendu Chatterjee and Laurent Doyen.
Graph Planning with Expected Finite Horizon.
Journal of Computer and System Sciences (JCSS) 129, Elsevier, 2022, pp. 1-21.
[
pdf]
Laurent Doyen, Thierry Massart, and Mahsa Shirmohammadi.
The Complexity of Synchronizing Markov Decision Processes.
Journal of Computer and System Sciences (JCSS) 100, Elsevier, 2019, pp. 96-129.
[
pdf]
Krishnendu Chatterjee and Laurent Doyen.
Stochastic Processes with Expected Stopping Time.
Logical Methods in Computer Science 20(4), 2024.
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger.
Expressiveness and Closure Properties for Quantitative Languages.
Logical Methods in Computer Science 6(3:10), 2010.
[
ps]
[
pdf]
Laurent Doyen and Jean-François Raskin.
Antichains for the automata-based approach to model-checking.
Logical Methods in Computer Science 5(1:5), 2009.
[
ps]
[
pdf]
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin.
Algorithms for omega-regular games of imperfect information.
Logical Methods in Computer Science 3(3:4), 2007.
[
ps]
[
pdf]
Krishnendu Chatterjee and Laurent Doyen.
Energy Parity Games.
Theoretical Computer Science 458(2): 49-60, Elsevier, 2012.
[
ps]
[
pdf]
Dietmar Berwanger and Laurent Doyen.
Observation and Distinction. Representing Information in Infinite Games.
Theory of Computing Systems (ToCS) 67(1), 2023, Springer, pp. 4-27.
[
pdf]