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