- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i17 |      | Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin: Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013) |
| 2012 | ||
| j13 | | |
| c37 | | Krishnendu Chatterjee, Laurent Doyen: Partial-Observation Stochastic Games: How to Win When Belief Fails. LICS 2012: 175-184 |
| i16 | | Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi: Infinite Synchronizing Words for Probabilistic Automata (Erratum). CoRR abs/1206.0995 (2012) |
| i15 | | Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin: The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012) |
| i14 | | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012) |
| 2011 | ||
| j12 | | Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin: Faster algorithms for mean-payoff games. Formal Methods in System Design 38(2): 97-118 (2011) |
| j11 | | Laurent Doyen, Olivier Gaudoin: Modeling and Assessment of Aging and Efficiency of Corrective and Planned Preventive Maintenance. IEEE Transactions on Reliability 60(4): 759-769 (2011) |
| c36 | | Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin: Antichain-Based QBF Solving. ATVA 2011: 183-197 |
| c35 | | Krishnendu Chatterjee, Laurent Doyen, Rohit Singh: On Memoryless Quantitative Objectives. FCT 2011: 148-159 |
| c34 | | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 |
| c33 | | Krishnendu Chatterjee, Laurent Doyen: Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives. MEMICS 2011: 37-46 |
| c32 | | Krishnendu Chatterjee, Laurent Doyen: Energy and Mean-Payoff Parity Markov Decision Processes. MFCS 2011: 206-218 |
| c31 | | Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi: Infinite Synchronizing Words for Probabilistic Automata. MFCS 2011: 278-289 |
| c30 | | Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi: Synchronizing Objectives for Markov Decision Processes. iWIGP 2011: 61-75 |
| i13 | | Krishnendu Chatterjee, Laurent Doyen: Energy and Mean-Payoff Parity Markov Decision Processes. CoRR abs/1104.2909 (2011) |
| i12 | | Krishnendu Chatterjee, Laurent Doyen, Rohit Singh: On Memoryless Quantitative Objectives. CoRR abs/1104.3211 (2011) |
| i11 | | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011) |
| i10 | | Krishnendu Chatterjee, Laurent Doyen: Partial-Observation Stochastic Games: How to Win when Belief Fails. CoRR abs/1107.2141 (2011) |
| 2010 | ||
| j10 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. Logical Methods in Computer Science 6(3) (2010) |
| j9 | | Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Strategy construction for parity games with imperfect information. Inf. Comput. 208(10): 1206-1220 (2010) |
| j8 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Quantitative languages. ACM Trans. Comput. Log. 11(4) (2010) |
| c29 | | Laurent Doyen, Thomas A. Henzinger, Axel Legay, Dejan Nickovic: Robustness of Sequential Circuits. ACSD 2010: 77-84 |
| c28 | | Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou: Mean-Payoff Automaton Expressions. CONCUR 2010: 269-283 |
| c27 | | Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk: Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274 |
| c26 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516 |
| c25 | | |
| c24 | | Krishnendu Chatterjee, Laurent Doyen: The Complexity of Partial-Observation Parity Games. LPAR (Yogyakarta) 2010: 1-14 |
| c23 | | Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. MFCS 2010: 246-257 |
| c22 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Qualitative Analysis of Partially-Observable Markov Decision Processes. MFCS 2010: 258-269 |
| c21 | | |
| i9 | | |
| i8 | | Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. CoRR abs/1006.0673 (2010) |
| i7 | | Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou: Mean-payoff Automaton Expressions. CoRR abs/1006.1492 (2010) |
| i6 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. CoRR abs/1007.1669 (2010) |
| 2009 | ||
| j7 | | Laurent Doyen, Jean-François Raskin: Antichains for the Automata-Based Approach to Model-Checking. Logical Methods in Computer Science 5(1) (2009) |
| c20 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Probabilistic Weighted Automata. CONCUR 2009: 244-258 |
| c19 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Alternating Weighted Automata. FCT 2009: 3-13 |
| c18 | | Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert: Realizability of Real-Time Logics. FORMATS 2009: 133-148 |
| c17 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: A Survey of Stochastic Games with Limsup and Liminf Objectives. ICALP (2) 2009: 1-15 |
| c16 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. LICS 2009: 199-208 |
| c15 | | Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Alpaga: A Tool for Solving Parity Games with Imperfect Information. TACAS 2009: 58-61 |
| i5 | | Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Alpaga: A Tool for Solving Parity Games with Imperfect Information. CoRR abs/0901.4728 (2009) |
| i4 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. CoRR abs/0905.2195 (2009) |
| i3 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Qualitative Analysis of Partially-observable Markov Decision Processes. CoRR abs/0909.1645 (2009) |
| i2 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Probabilistic Weighted Automata. CoRR abs/0909.1647 (2009) |
| 2008 | ||
| j6 | | Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin: Robust safety of timed automata. Formal Methods in System Design 33(1-3): 45-84 (2008) |
| j5 | | Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Equivalence of Labeled Markov Chains. Int. J. Found. Comput. Sci. 19(3): 549-563 (2008) |
| c14 | | |
| c13 | | Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje: Strategy Construction for Parity Games with Imperfect Information. CONCUR 2008: 325-339 |
| c12 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Quantitative Languages. CSL 2008: 385-400 |
| c11 | | Laurent Doyen, Thomas A. Henzinger, Barbara Jobstmann, Tatjana Petrov: Interface theories with component reuse. EMSOFT 2008: 79-88 |
| c10 | | |
| c9 | | Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. TACAS 2008: 63-77 |
| 2007 | ||
| j4 | | Laurent Doyen: Robust parametric reachability for timed automata. Inf. Process. Lett. 102(5): 208-213 (2007) |
| j3 | | Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Algorithms for Omega-Regular Games with Imperfect Information. Logical Methods in Computer Science 3(3) (2007) |
| c8 | | Laurent Doyen, Jean-François Raskin: Improved Algorithms for the Automata-Based Approach to Model-Checking. TACAS 2007: 451-465 |
| i1 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information. CoRR abs/0706.2619 (2007) |
| 2006 | ||
| c7 | | Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Antichains: A New Algorithm for Checking Universality of Finite Automata. CAV 2006: 17-30 |
| c6 | | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information, . CSL 2006: 287-302 |
| c5 | | Martin De Wulf, Laurent Doyen, Jean-François Raskin: A Lattice Theory for Solving Games of Imperfect Information. HSCC 2006: 153-168 |
| 2005 | ||
| j2 | | Martin De Wulf, Laurent Doyen, Jean-François Raskin: Almost ASAP semantics: from timed models to timed implementations. Formal Asp. Comput. 17(3): 319-341 (2005) |
| c4 | | Martin De Wulf, Laurent Doyen, Jean-François Raskin: Systematic Implementation of Real-Time Models. FM 2005: 139-156 |
| c3 | | Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Automatic Rectangular Refinement of Affine Hybrid Systems. FORMATS 2005: 144-161 |
| 2004 | ||
| j1 | | Laurent Doyen, Olivier Gaudoin: Classes of imperfect repair models based on reduction of failure intensity or virtual age. Rel. Eng. & Sys. Safety 84(1): 45-56 (2004) |
| c2 | | Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin: Robustness and Implementability of Timed Automata. FORMATS/FTRTFT 2004: 118-133 |
| c1 | | Martin De Wulf, Laurent Doyen, Jean-François Raskin: Almost ASAP Semantics: From Timed Models to Timed Implementations. HSCC 2004: 296-310 |
Colors in the list of coauthors
Last update Sat May 25 01:48:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page