Laurent Doyen


Ontology type: schema:Person     


Person Info

NAME

Laurent

SURNAME

Doyen

Publications in SciGraph latest 50 shown

  • 2017-08-25 The Multiple Dimensions of Mean-Payoff Games in REACHABILITY PROBLEMS
  • 2017-07-25 The Cost of Exactness in Quantitative Reachability in MODELS, ALGORITHMS, LOGICS AND TOOLS
  • 2015 The Complexity of Synthesis from Probabilistic Components in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 Games with a Weak Adversary in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 2014 Doomsday Equilibria for Omega-Regular Games in VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION
  • 2014 Robust Synchronization in Markov Decision Processes in CONCUR 2014 – CONCURRENCY THEORY
  • 2014 Perfect-Information Stochastic Mean-Payoff Parity Games in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 2014 Limit Synchronization in Markov Decision Processes in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 2013-10 A survey of partial-observation stochastic parity games in FORMAL METHODS IN SYSTEM DESIGN
  • 2013 Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2013 Looking at Mean-Payoff and Total-Payoff through Windows in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2012 Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives in MATHEMATICAL AND ENGINEERING METHODS IN COMPUTER SCIENCE
  • 2011-04 Faster algorithms for mean-payoff games in FORMAL METHODS IN SYSTEM DESIGN
  • 2011 Energy and Mean-Payoff Parity Markov Decision Processes in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Antichain-Based QBF Solving in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2011 On Reachability for Hybrid Automata over Bounded Time in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Infinite Synchronizing Words for Probabilistic Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 On Memoryless Quantitative Objectives in FUNDAMENTALS OF COMPUTATION THEORY
  • 2010 Mean-Payoff Automaton Expressions in CONCUR 2010 - CONCURRENCY THEORY
  • 2010 Randomness for Free in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2010 Energy Parity Games in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2010 Energy and Mean-Payoff Games with Imperfect Information in COMPUTER SCIENCE LOGIC
  • 2010 The Complexity of Partial-Observation Parity Games in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2010 Antichain Algorithms for Finite Automata in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2010 Qualitative Analysis of Partially-Observable Markov Decision Processes in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2009 Probabilistic Weighted Automata in CONCUR 2009 - CONCURRENCY THEORY
  • 2009 Alternating Weighted Automata in FUNDAMENTALS OF COMPUTATION THEORY
  • 2009 Alpaga: A Tool for Solving Parity Games with Imperfect Information in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2009 Realizability of Real-Time Logics in FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS
  • 2009 A Survey of Stochastic Games with Limsup and Liminf Objectives in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008-12 Robust safety of timed automata in FORMAL METHODS IN SYSTEM DESIGN
  • 2008 Alaska in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2008 Strategy Construction for Parity Games with Imperfect Information in CONCUR 2008 - CONCURRENCY THEORY
  • 2008 Quantitative Languages in COMPUTER SCIENCE LOGIC
  • 2008 Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2007 Improved Algorithms for the Automata-Based Approach to Model-Checking in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2006 Antichains: A New Algorithm for Checking Universality of Finite Automata in COMPUTER AIDED VERIFICATION
  • 2006 Algorithms for Omega-Regular Games with Imperfect Information in COMPUTER SCIENCE LOGIC
  • 2006 A Lattice Theory for Solving Games of Imperfect Information in HYBRID SYSTEMS: COMPUTATION AND CONTROL
  • 2005-10 Almost ASAP semantics: from timed models to timed implementations in FORMAL ASPECTS OF COMPUTING
  • 2005 Automatic Rectangular Refinement of Affine Hybrid Systems in FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS
  • 2005 Systematic Implementation of Real-Time Models in FM 2005: FORMAL METHODS
  • 2004 Robustness and Implementability of Timed Automata in FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS
  • 2004 Almost ASAP Semantics: From Timed Models to Timed Implementations in HYBRID SYSTEMS: COMPUTATION AND CONTROL
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.464035.0", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Doyen", 
        "givenName": "Laurent", 
        "id": "sg:person.010301575457.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010301575457.70"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:07", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1893.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010301575457.70'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010301575457.70'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010301575457.70'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010301575457.70'


     




    Preview window. Press ESC to close (or click here)


    ...