BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Croatia
1 × Cyprus
1 × Czech Republic
1 × Denmark
1 × Greece
1 × Italy
1 × Japan
1 × Portugal
1 × Switzerland
2 × France
2 × Hungary
2 × United Kingdom
3 × USA
Collaborated with:
K.Chatterjee J.Raskin T.A.Henzinger M.D.Wulf M.Y.Vardi T.Massart M.Shirmohammadi H.Gimbert Y.Oualhadj S.Nain E.Filiot N.Maquet A.Degorre R.Gentilini S.Torunczyk D.Berwanger T.Brihaye G.Geeraerts J.Ouaknine J.Worrell
Talks about:
game (10) algorithm (5) stochast (4) automata (4) pariti (4) inform (4) imperfect (3) antichain (3) model (3) finit (3)

Person: Laurent Doyen

DBLP DBLP: Doyen:Laurent

Contributed to:

ICALP (2) 20152015
FoSSaCS 20142014
ICALP (2) 20142014
VMCAI 20142014
LICS 20122012
ICALP (2) 20112011
CSL 20102010
ICALP (2) 20102010
TACAS 20102010
ICALP (2) 20092009
LICS 20092009
TACAS 20092009
CSL 20082008
TACAS 20082008
DLT 20072008
TACAS 20072007
CAV 20062006
CSL 20062006
FM 20052005

Wrote 21 papers:

ICALP-v2-2015-Chatterjee0V #complexity #component #probability #synthesis
The Complexity of Synthesis from Probabilistic Components (KC, LD, MYV), pp. 108–120.
FoSSaCS-2014-0001MS #markov #process
Limit Synchronization in Markov Decision Processes (LD, TM, MS), pp. 58–72.
FoSSaCS-2014-Chatterjee0GO #game studies #probability
Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
ICALP-v2-2014-Chatterjee0 #game studies
Games with a Weak Adversary (KC, LD), pp. 110–121.
VMCAI-2014-Chatterjee0FR #game studies
Doomsday Equilibria for Omega-Regular Games (KC, LD, EF, JFR), pp. 78–97.
LICS-2012-ChatterjeeD #game studies #how #probability
Partial-Observation Stochastic Games: How to Win When Belief Fails (KC, LD), pp. 175–184.
ICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the #reachability
On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
CSL-2010-DegorreDGRT #energy #game studies
Energy and Mean-Payoff Games with Imperfect Information (AD, LD, RG, JFR, ST), pp. 260–274.
ICALP-v2-2010-ChatterjeeD #energy #game studies
Energy Parity Games (KC, LD), pp. 599–610.
TACAS-2010-DoyenR #algorithm #automaton #finite
Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.
ICALP-v2-2009-ChatterjeeDH #game studies #overview #probability
A Survey of Stochastic Games with Limsup and Liminf Objectives (KC, LD, TAH), pp. 1–15.
LICS-2009-ChatterjeeDH
Expressiveness and Closure Properties for Quantitative Languages (KC, LD, TAH), pp. 199–208.
TACAS-2009-BerwangerCWDH #game studies #named
Alpaga: A Tool for Solving Parity Games with Imperfect Information (DB, KC, MDW, LD, TAH), pp. 58–61.
CSL-2008-ChatterjeeDH
Quantitative Languages (KC, LD, TAH), pp. 385–400.
TACAS-2008-WulfDMR #algorithm #anti #ltl #model checking #named #satisfiability
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (MDW, LD, NM, JFR), pp. 63–77.
DLT-J-2007-DoyenHR08 #equivalence #markov
Equivalence of Labeled Markov Chains (LD, TAH, JFR), pp. 549–563.
TACAS-2007-DoyenR #algorithm #approach #model checking
Improved Algorithms for the Automata-Based Approach to Model-Checking (LD, JFR), pp. 451–465.
CAV-2006-WulfDHR #algorithm #anti #automaton #finite #named
Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.
CSL-2006-ChatterjeeDHR #algorithm #game studies
Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.
FM-2005-WulfDR #implementation #modelling #realtime
Systematic Implementation of Real-Time Models (MDW, LD, JFR), pp. 139–156.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.