Patricia Bouyer

	2009
59		Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault: Measuring Permissivity in Finite Games. CONCUR 2009: 196-210
58		Patricia Bouyer, Vojtech Forejt: Reachability in Stochastic Timed Games. ICALP (2) 2009: 103-114
57		Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye: When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54
56		Patricia Bouyer: Model-checking Timed Temporal Logics. Electr. Notes Theor. Comput. Sci. 231: 323-341 (2009)
55		Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Undecidability Results for Timed Automata with Silent Transitions. Fundam. Inform. 92(1-2): 1-25 (2009)
	2008
54		Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba: Infinite Runs in Weighted Timed Automata with Energy Constraints. FORMATS 2008: 33-47
53		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
52		Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier: Robust Analysis of Timed Automata ViaChannel Machines. FoSSaCS 2008: 157-171
51		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135
50		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
49		Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey: Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64
48		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132
47		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines CoRR abs/0802.2839: (2008)
46		Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model Checking One-clock Priced Timed Automata CoRR abs/0805.1457: (2008)
45		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)
44		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)
43		Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model Checking One-Clock Priced Timed Automata. Logical Methods in Computer Science 4(2): (2008)
	2007
42		Patricia Bouyer, Nicolas Markey: Costs Are Expensive! FORMATS 2007: 53-68
41		Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer: Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191
40		Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey: Model-Checking One-Clock Priced Timed Automata. FoSSaCS 2007: 108-122
39		Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! LFCS 2007: 69-83
38		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120
37		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)
	2006
36		Eugene Asarin, Patricia Bouyer: Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings Springer 2006
35		Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad: Extended Timed Automata and Time Petri Nets. ACSD 2006: 91-100
34		Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier: Timed Unfoldings for Networks of Timed Automata. ATVA 2006: 292-306
33		Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie: Timed Temporal Logics for Abstracting Transient States. ATVA 2006: 337-351
32		Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier: Controller Synthesis for MTL Specifications. CONCUR 2006: 450-464
31		Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen: Almost Optimal Strategies in One Clock Priced Timed Games. FSTTCS 2006: 345-356
30		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
29		Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier: Robust Model-Checking of Linear-Time Properties in Timed Automata. LATIN 2006: 238-249
28		Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier: Control in o-minimal Hybrid Systems. LICS 2006: 367-378
27		Patricia Bouyer: Weighted Timed Automata: Model-Checking and Games. Electr. Notes Theor. Comput. Sci. 158: 3-17 (2006)
26		Patricia Bouyer, Thomas Brihaye, Nicolas Markey: Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5): 188-194 (2006)
25		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)
	2005
24		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
23		Patricia Bouyer, Franck Cassez, François Laroussinie: Modal Logics for Timed Control. CONCUR 2005: 81-94
22		Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier: Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS 2005: 112-126
21		Patricia Bouyer, Fabrice Chevalier, Nicolas Markey: On the Expressiveness of TPTL and MTL. FSTTCS 2005: 432-443
20		Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza: Fault Diagnosis Using Timed Automata. FoSSaCS 2005: 219-233
19		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)
18		Patricia Bouyer, Fabrice Chevalier: On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics 10(4): 393-405 (2005)
	2004
17		Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen: Optimal Strategies in Priced Timed Game Automata. FSTTCS 2004: 148-160
16		Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen: Staying Alive as Cheaply as Possible. HSCC 2004: 203-218
15		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
14		Patricia Bouyer: Forward Analysis of Updatable Timed Automata. Formal Methods in System Design 24(3): 281-320 (2004)
13		Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Updatable timed automata. Theor. Comput. Sci. 321(2-3): 291-345 (2004)
	2003
12		Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit: Timed Control with Partial Observability. CAV 2003: 180-192
11		Patricia Bouyer: Untameable Timed Automata! STACS 2003: 620-631
10		Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim Guldstrand Larsen: Static Guard Analysis in Timed Automata Verification. TACAS 2003: 254-277
9		Patricia Bouyer, Antoine Petit, Denis Thérien: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2): 137-162 (2003)
8		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)
	2002
7		Patricia Bouyer: A logical characterization of data languages. Inf. Process. Lett. 84(2): 75-85 (2002)
6		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
5		Patricia Bouyer, Antoine Petit, Denis Thérien: An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261
	2000
4		Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Are Timed Automata Updatable? CAV 2000: 464-479
3		Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit: Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242
	1999
2		Patricia Bouyer, Antoine Petit: Decomposition and Composition of Timed Automata. ICALP 1999: 210-219
	1998
1		Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen: The Power of Reachability Testing for Timed Automata. FSTTCS 1998: 245-256

Coauthor Index

1	Luca Aceto	[1] [8]
2	Eugene Asarin	[36]
3	Christel Baier	[41] [50] [57]
4	Gerd Behrmann	[10] [15] [25]
5	Béatrice Bérard	[24] [33]
6	Nathalie Bertrand	[41] [49] [50] [57]
7	Laura Bozzelli	[32]
8	Thomas Brihaye	[26] [28] [37] [39] [41] [49] [50] [53] [57]
9	Ed Brinksma	[16] [45]
10	Véronique Bruyère	[37]
11	Augusto Burgueño	[1] [8]
12	Franck Cassez	[17] [19] [23]
13	Fabrice Chevalier	[18] [20] [21] [28] [32] [39]
14	Deepak D'Souza	[12] [20]
15	Marie Duflot	[59]
16	Catherine Dufourd	[3] [4] [13]
17	Ulrich Fahrenberg	[54]
18	Emmanuel Fleury	[3] [4] [10] [13] [17] [19]
19	Vojtech Forejt	[58]
20	Marcus Größer	[41] [50]
21	Serge Haddad	[30] [34] [35] [44] [55]
22	Marcin Jurdzinski	[53]
23	François Laroussinie	[22] [23] [24] [33]
24	Kim Guldstrand Larsen	[1] [8] [10] [15] [16] [17] [19] [25] [31] [40] [43] [45] [46] [54]
25	Ranko Lazic (R. S. Lazic)	[53]
26	P. Madhusudan (Parthasarathy Madhusudan)	[12]
27	Nicolas Markey	[21] [26] [29] [31] [38] [40] [42] [43] [46] [47] [48] [49] [51] [52] [54] [59]
28	Houda Bel Mokadem	[24] [33]
29	Joël Ouaknine	[38] [47] [48] [51]
30	Radek Pelánek	[15] [25]
31	Antoine Petit	[2] [3] [4] [5] [6] [9] [12] [13]
32	Jean-François Raskin	[37]
33	Jacob Illum Rasmussen	[31]
34	Gabriel Renault	[59]
35	Pierre-Alain Reynier	[22] [29] [30] [34] [35] [44] [52] [55]
36	Michal Rutkowski	[53]
37	Ph. Schnoebelen	[47] [48]
38	Jirí Srba	[54]
39	Denis Thérien	[5] [9]
40	James Worrell	[38] [47] [48] [51]

Colors in the list of coauthors