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]
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]
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.
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]
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]