Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Patricia Bouyer
Patricia Bouyer-Decitre
2010 – today
- 2012
[j24]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012)- [c53]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels: Concurrent Games with Ordered Objectives. FoSSaCS 2012: 301-315
- [c52]Patricia Bouyer, Nicolas Markey, Ocan Sankur: Robust Reachability in Timed Automata: A Game-Based Approach. ICALP (2) 2012: 128-140
- [c51]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Lower-Bound Constrained Runs in Weighted Timed Automata. QEST 2012: 128-137
- [c50]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet: Almost-Sure Model-Checking of Reactive Timed Automata. QEST 2012: 138-147
- 2011
- [j23]Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey: Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9): 78-87 (2011)
- [j22]Patricia Bouyer, Franck Cassez, François Laroussinie: Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. Journal of Logic, Language and Information 20(2): 169-203 (2011)
- [c49]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels: Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. ATVA 2011: 135-149
- [c48]Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane: Timed Automata Can Always Be Made Implementable. CONCUR 2011: 76-91
- [c47]Patricia Bouyer, Nicolas Markey, Ocan Sankur: Robust Model-Checking of Timed Automata via Pumping in Channel Machines. FORMATS 2011: 97-112
- [c46]
- [c45]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels: Nash Equilibria in Concurrent Games with Büchi Objectives. FSTTCS 2011: 375-386
- [c44]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer: Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257
- [i3]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels: Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. CoRR abs/1102.3615 (2011)
- 2010
- [j21]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: O-Minimal Hybrid Reachability Games. Logical Methods in Computer Science 6(1) (2010)
- [j20]Patricia Bouyer, Fabrice Chevalier, Nicolas Markey: On the expressiveness of TPTL and MTL. Inf. Comput. 208(2): 97-116 (2010)
- [c43]Patricia Bouyer, Romain Brenguier, Nicolas Markey: Nash Equilibria for Reachability Objectives in Multi-player Timed Games. CONCUR 2010: 192-206
- [c42]Patricia Bouyer, Romain Brenguier, Nicolas Markey: Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. FORMATS 2010: 62-76
- [c41]Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316
- [c40]Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey: Timed automata with observers under energy constraints. HSCC 2010: 61-70
2000 – 2009
- 2009
- [j19]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: Weighted o-minimal hybrid systems. Ann. Pure Appl. Logic 161(3): 268-288 (2009)
- [j18]Patricia Bouyer: Model-checking Timed Temporal Logics. Electr. Notes Theor. Comput. Sci. 231: 323-341 (2009)
- [j17]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Undecidability Results for Timed Automata with Silent Transitions. Fundam. Inform. 92(1-2): 1-25 (2009)
- [c39]Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault: Measuring Permissivity in Finite Games. CONCUR 2009: 196-210
- [c38]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye: When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54
- [c37]
- 2008
- [j16]Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design 32(1): 3-23 (2008)
- [j15]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Timed Petri nets and timed automata: On the discriminating power of zeno sequences. Inf. Comput. 206(1): 73-107 (2008)
- [j14]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model Checking One-Clock Priced Timed Automata. Logical Methods in Computer Science 4(2) (2008)
- [c36]Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba: Infinite Runs in Weighted Timed Automata with Energy Constraints. FORMATS 2008: 33-47
- [c35]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77
- [c34]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier: Robust Analysis of Timed Automata via Channel Machines. FoSSaCS 2008: 157-171
- [c33]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135
- [c32]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer: Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS 2008: 217-226
- [c31]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey: Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64
- [c30]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132
- [i2]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008)
- [i1]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model Checking One-clock Priced Timed Automata. CoRR abs/0805.1457 (2008)
- 2007
- [j13]Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin: On the optimal reachability problem of weighted timed automata. Formal Methods in System Design 31(2): 135-175 (2007)
- [c29]
- [c28]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model-Checking One-Clock Priced Timed Automata. FoSSaCS 2007: 108-122
- [c27]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer: Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191
- [c26]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! LFCS 2007: 69-83
- [c25]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120
- 2006
- [j12]Patricia Bouyer, Fabrice Chevalier: On the Control of Timed and Hybrid Systems. Bulletin of the EATCS 89: 79-96 (2006)
- [j11]Patricia Bouyer: Weighted Timed Automata: Model-Checking and Games. Electr. Notes Theor. Comput. Sci. 158: 3-17 (2006)
- [j10]Patricia Bouyer, Thomas Brihaye, Nicolas Markey: Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5): 188-194 (2006)
- [j9]Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek: Lower and upper bounds in zone-based abstractions of timed automata. STTT 8(3): 204-215 (2006)
- [c24]Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad: Extended Timed Automata and Time Petri Nets. ACSD 2006: 91-100
- [c23]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Timed Unfoldings for Networks of Timed Automata. ATVA 2006: 292-306
- [c22]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie: Timed Temporal Logics for Abstracting Transient States. ATVA 2006: 337-351
- [c21]Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier: Controller Synthesis for MTL Specifications. CONCUR 2006: 450-464
- [c20]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen: Almost Optimal Strategies in One Clock Priced Timed Games. FSTTCS 2006: 345-356
- [c19]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. ICALP (2) 2006: 420-431
- [c18]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier: Robust Model-Checking of Linear-Time Properties in Timed Automata. LATIN 2006: 238-249
- [c17]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: Control in o-minimal Hybrid Systems. LICS 2006: 367-378
- [e1]Eugene Asarin, Patricia Bouyer (Eds.): Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings. Lecture Notes in Computer Science 4202, Springer 2006, ISBN 3-540-45026-2
- 2005
- [j8]Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen: Synthesis of Optimal Strategies Using HyTech. Electr. Notes Theor. Comput. Sci. 119(1): 11-31 (2005)
- [j7]Patricia Bouyer, Fabrice Chevalier: On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics 10(4): 393-405 (2005)
- [c16]Patricia Bouyer, Franck Cassez, François Laroussinie: Modal Logics for Timed Control. CONCUR 2005: 81-94
- [c15]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie: A New Modality for Almost Everywhere Properties in Timed Automata. CONCUR 2005: 110-124
- [c14]Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier: Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS 2005: 112-126
- [c13]Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza: Fault Diagnosis Using Timed Automata. FoSSaCS 2005: 219-233
- [c12]Patricia Bouyer, Fabrice Chevalier, Nicolas Markey: On the Expressiveness of TPTL and MTL. FSTTCS 2005: 432-443
- 2004
- [j6]Patricia Bouyer: Forward Analysis of Updatable Timed Automata. Formal Methods in System Design 24(3): 281-320 (2004)
- [j5]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Updatable timed automata. Theor. Comput. Sci. 321(2-3): 291-345 (2004)
- [c11]Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen: Optimal Strategies in Priced Timed Game Automata. FSTTCS 2004: 148-160
- [c10]Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen: Staying Alive as Cheaply as Possible. HSCC 2004: 203-218
- [c9]Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek: Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. TACAS 2004: 312-326
- 2003
- [j4]Patricia Bouyer, Antoine Petit, Denis Thérien: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2): 137-162 (2003)
- [j3]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen: The power of reachability testing for timed automata. Theor. Comput. Sci. 300(1-3): 411-475 (2003)
- [c8]Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit: Timed Control with Partial Observability. CAV 2003: 180-192
- [c7]
- [c6]Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim Guldstrand Larsen: Static Guard Analysis in Timed Automata Verification. TACAS 2003: 254-277
- 2002
- [j2]Patricia Bouyer: A logical characterization of data languages. Inf. Process. Lett. 84(2): 75-85 (2002)
- [j1]Patricia Bouyer, Antoine Petit: A Kleene/Büchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics 7(2): 167-186 (2002)
- 2001
- [c5]Patricia Bouyer, Antoine Petit, Denis Thérien: An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261
- 2000
- [c4]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Are Timed Automata Updatable? CAV 2000: 464-479
- [c3]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242
1990 – 1999
- 1999
- [c2]Patricia Bouyer, Antoine Petit: Decomposition and Composition of Timed Automata. ICALP 1999: 210-219
- 1998
- [c1]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen: The Power of Reachability Testing for Timed Automata. FSTTCS 1998: 245-256
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:45 CET by the dblp team