| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Concurrent Games with Ordered Objectives.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey |
Quantitative analysis of real-time systems using priced timed automata. |
Commun. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Franck Cassez, François Laroussinie |
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. |
Journal of Logic, Language and Information |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels |
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane |
Timed Automata Can Always Be Made Implementable. |
CONCUR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer |
Emptiness and Universality Problems in Timed Automata with Positive Frequency. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Ocan Sankur |
Robust Model-Checking of Timed Automata via Pumping in Channel Machines. |
FORMATS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels |
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. |
ATVA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ocan Sankur, Patricia Bouyer, Nicolas Markey |
Shrinking Timed Automata. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Nash Equilibria in Concurrent Games with Büchi Objectives. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier, Nicolas Markey |
On the expressiveness of TPTL and MTL. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier |
O-Minimal Hybrid Reachability Games |
Logical Methods in Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey |
Nash Equilibria for Reachability Objectives in Multi-player Timed Games. |
CONCUR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey |
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. |
FORMATS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey |
Timed automata with observers under energy constraints. |
HSCC |
2010 |
DBLP DOI BibTeX RDF |
weighted timed automata, energy constraints |
| 1 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
Computing Rational Radical Sums in Uniform TC^0. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer |
Model-checking Timed Temporal Logics. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier |
Weighted o-minimal hybrid systems. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier |
Undecidability Results for Timed Automata with Silent Transitions. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault |
Measuring Permissivity in Finite Games. |
CONCUR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye |
When Are Timed Automata Determinizable? |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Vojtech Forejt |
Reachability in Stochastic Timed Games. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier |
Timed Petri nets and timed automata: On the discriminating power of zeno sequences. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model Checking One-Clock Priced Timed Automata. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model Checking One-clock Priced Timed Automata |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen |
Optimal infinite scheduling for multi-priced timed automata. |
Formal Methods in System Design |
2008 |
DBLP DOI BibTeX RDF |
Priced timed automata, Optimal mean-payoff |
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
On Expressiveness and Complexity in Real-Time Model Checking. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba |
Infinite Runs in Weighted Timed Automata with Energy Constraints. |
FORMATS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski |
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. |
FORMATS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey |
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. |
QEST |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier |
Robust Analysis of Timed Automata via Channel Machines. |
FoSSaCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
Weighted timed automaton, Cost-optimal reachability problem |
| 1 | Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier |
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey |
Costs Are Expensive! |
FORMATS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
The Cost of Punctuality. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model-Checking One-Clock Priced Timed Automata. |
FoSSaCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer |
Probabilistic and Topological Semantics for Timed Automata. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Nicolas Markey |
Improved undecidability results on weighted timed automata. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer |
Weighted Timed Automata: Model-Checking and Games. |
Electr. Notes Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier |
On the Control of Timed and Hybrid Systems. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek |
Lower and upper bounds in zone-based abstractions of timed automata. |
STTT |
2006 |
DBLP DOI BibTeX RDF |
Verification, Abstraction, Timed automata, Extrapolation |
| 1 | Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier |
Controller Synthesis for MTL Specifications. |
CONCUR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad |
Extended Timed Automata and Time Petri Nets. |
ACSD |
2006 |
DBLP DOI BibTeX RDF |
Conciseness, Timed Automata, Reachability Analysis, Time Petri Nets |
| 1 | Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier |
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene Asarin, Patricia Bouyer (eds.) |
Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings |
FORMATS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier |
Robust Model-Checking of Linear-Time Properties in Timed Automata. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
robust verification, Implementability, timed systems |
| 1 | Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie |
Timed Temporal Logics for Abstracting Transient States. |
ATVA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier |
Timed Unfoldings for Networks of Timed Automata. |
ATVA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier |
Control in o-minimal Hybrid Systems. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen |
Almost Optimal Strategies in One Clock Priced Timed Games. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen |
Synthesis of Optimal Strategies Using HyTech. |
Electr. Notes Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier |
On Conciseness of Extensions of Timed Automata. |
Journal of Automata, Languages and Combinatorics |
2005 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Franck Cassez, François Laroussinie |
Modal Logics for Timed Control. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie |
A New Modality for Almost Everywhere Properties in Timed Automata. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier |
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. |
FORMATS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza |
Fault Diagnosis Using Timed Automata. |
FoSSaCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier, Nicolas Markey |
On the Expressiveness of TPTL and MTL. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit |
Updatable timed automata. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer |
Forward Analysis of Updatable Timed Automata. |
Formal Methods in System Design |
2004 |
DBLP DOI BibTeX RDF |
(updatable) timed automata, forward analysis algorithm, widening operator, data structure, correctness |
| 1 | Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek |
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. |
TACAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen |
Staying Alive as Cheaply as Possible. |
HSCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen |
Optimal Strategies in Priced Timed Game Automata. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen |
The power of reachability testing for timed automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit, Denis Thérien |
An algebraic approach to data languages and timed languages. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim Guldstrand Larsen |
Static Guard Analysis in Timed Automata Verification. |
TACAS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer |
Untameable Timed Automata! |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit |
Timed Control with Partial Observability. |
CAV |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer |
A logical characterization of data languages. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit |
A Kleene/Büchi-like Theorem for Clock Languages. |
Journal of Automata, Languages and Combinatorics |
2002 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit, Denis Thérien |
An Algebraic Characterization of Data and Timed Languages. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit |
Expressiveness of Updatable Timed Automata. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit |
Are Timed Automata Updatable? |
CAV |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit |
Decomposition and Composition of Timed Automata. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen |
The Power of Reachability Testing for Timed Automata. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")