The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patricia Bouyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad
    Extended Timed Automata and Time Petri Nets. [Citation Graph (0, 0)][DBLP]
    ACSD, 2006, pp:91-100 [Conf]
  2. Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
    Timed Temporal Logics for Abstracting Transient States. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:337-351 [Conf]
  3. Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
    Timed Unfoldings for Networks of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:292-306 [Conf]
  4. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Are Timed Automata Updatable? [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:464-479 [Conf]
  5. Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit
    Timed Control with Partial Observability. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:180-192 [Conf]
  6. Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
    Controller Synthesis for MTL Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:450-464 [Conf]
  7. Patricia Bouyer, Franck Cassez, François Laroussinie
    Modal Logics for Timed Control. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:81-94 [Conf]
  8. Patricia Bouyer, Antoine Petit, Denis Thérien
    An Algebraic Characterization of Data and Timed Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:248-261 [Conf]
  9. Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
    A New Modality for Almost Everywhere Properties in Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:110-124 [Conf]
  10. Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier
    Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:112-126 [Conf]
  11. Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
    Fault Diagnosis Using Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:219-233 [Conf]
  12. Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen
    Optimal Strategies in Priced Timed Game Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:148-160 [Conf]
  13. Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
    On the Expressiveness of TPTL and MTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:432-443 [Conf]
  14. Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen
    Almost Optimal Strategies in One Clock Priced Timed Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:345-356 [Conf]
  15. Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen
    The Power of Reachability Testing for Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:245-256 [Conf]
  16. Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen
    Staying Alive as Cheaply as Possible. [Citation Graph (0, 0)][DBLP]
    HSCC, 2004, pp:203-218 [Conf]
  17. Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
    Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:420-431 [Conf]
  18. Patricia Bouyer, Antoine Petit
    Decomposition and Composition of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:210-219 [Conf]
  19. Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
    Robust Model-Checking of Linear-Time Properties in Timed Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:238-249 [Conf]
  20. Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
    Control in o-minimal Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:367-378 [Conf]
  21. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Expressiveness of Updatable Timed Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:232-242 [Conf]
  22. Patricia Bouyer
    Untameable Timed Automata! [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:620-631 [Conf]
  23. Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim Guldstrand Larsen
    Static Guard Analysis in Timed Automata Verification. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:254-277 [Conf]
  24. Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek
    Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:312-326 [Conf]
  25. Patricia Bouyer
    Weighted Timed Automata: Model-Checking and Games. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:3-17 [Journal]
  26. Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen
    Synthesis of Optimal Strategies Using HyTech. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:1, pp:11-31 [Journal]
  27. Patricia Bouyer
    Forward Analysis of Updatable Timed Automata. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2004, v:24, n:3, pp:281-320 [Journal]
  28. Patricia Bouyer, Antoine Petit, Denis Thérien
    An algebraic approach to data languages and timed languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:2, pp:137-162 [Journal]
  29. Patricia Bouyer
    A logical characterization of data languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:2, pp:75-85 [Journal]
  30. Patricia Bouyer, Thomas Brihaye, Nicolas Markey
    Improved undecidability results on weighted timed automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:5, pp:188-194 [Journal]
  31. Patricia Bouyer, Antoine Petit
    A Kleene/Büchi-like Theorem for Clock Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:167-186 [Journal]
  32. Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek
    Lower and upper bounds in zone-based abstractions of timed automata. [Citation Graph (0, 0)][DBLP]
    STTT, 2006, v:8, n:3, pp:204-215 [Journal]
  33. Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen
    The power of reachability testing for timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:411-475 [Journal]
  34. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Updatable timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:291-345 [Journal]
  35. Patricia Bouyer, Nicolas Markey
    Costs Are Expensive! [Citation Graph (0, 0)][DBLP]
    FORMATS, 2007, pp:53-68 [Conf]
  36. Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey
    Model-Checking One-Clock Priced Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:108-122 [Conf]
  37. Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
    Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:69-83 [Conf]
  38. Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
    The Cost of Punctuality. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:109-120 [Conf]
  39. Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    On the optimal reachability problem of weighted timed automata. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:31, n:2, pp:135-175 [Journal]

  40. Measuring Permissivity in Finite Games. [Citation Graph (, )][DBLP]


  41. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. [Citation Graph (, )][DBLP]


  42. Infinite Runs in Weighted Timed Automata with Energy Constraints. [Citation Graph (, )][DBLP]


  43. Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. [Citation Graph (, )][DBLP]


  44. Robust Analysis of Timed Automata via Channel Machines. [Citation Graph (, )][DBLP]


  45. Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]


  46. Timed automata with observers under energy constraints. [Citation Graph (, )][DBLP]


  47. On Expressiveness and Complexity in Real-Time Model Checking. [Citation Graph (, )][DBLP]


  48. Reachability in Stochastic Timed Games. [Citation Graph (, )][DBLP]


  49. When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]


  50. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. [Citation Graph (, )][DBLP]


  51. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. [Citation Graph (, )][DBLP]


  52. On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]


  53. Weighted o-minimal hybrid systems. [Citation Graph (, )][DBLP]


  54. On Termination for Faulty Channel Machines [Citation Graph (, )][DBLP]


  55. Model Checking One-clock Priced Timed Automata [Citation Graph (, )][DBLP]


  56. O-Minimal Hybrid Reachability Games [Citation Graph (, )][DBLP]


  57. Model-checking Timed Temporal Logics. [Citation Graph (, )][DBLP]


Search in 0.105secs, Finished in 0.107secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002