Patricia Bouyer

According to our database1, Patricia Bouyer
  • authored at least 129 papers between 1998 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Average-energy games.
Acta Inf., 2018

Dependences in Strategy Logic.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Games on Graphs with a Public Signal Monitoring.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Timed-automata abstraction of switched dynamical systems using control invariants.
Real-Time Systems, 2017

Nash equilibria in symmetric graph games with partial observation.
Inf. Comput., 2017

Games on graphs with a public signal monitoring.
CoRR, 2017

Dependences in Strategy Logic.
CoRR, 2017

Unbounded product-form Petri nets.
CoRR, 2017

Courcelle's Theorem Made Dynamic.
CoRR, 2017

When are Stochastic Transition Systems Tameable?
CoRR, 2017

Dynamic Complexity of the Dyck Reachability.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Bounding Average-Energy Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

On the Determinization of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Unbounded Product-Form Petri Nets.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Timed Temporal Logics.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
On the semantics of Strategy Logic.
Inf. Process. Lett., 2016

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.
Proceedings of the Seventh International Symposium on Games, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.
CoRR, 2016

Dynamic Complexity of Parity Games with Bounded Tree-Width.
CoRR, 2016

Dynamic Complexity of the Dyck Reachability.
CoRR, 2016

Bounding Average-energy Games.
CoRR, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.
CoRR, 2016

Stochastic Timed Games Revisited.
CoRR, 2016

Optimal Reachability in Weighted Timed Automata and Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Stochastic Timed Games Revisited.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Analysing Decisive Stochastic Processes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Compositional Design of Stochastic Timed Automata.
Proceedings of the Computer Science - Theory and Applications, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Robust reachability in timed automata and games: A game-based approach.
Theor. Comput. Sci., 2015

Permissive strategies in timed automata and games.
ECEASST, 2015

Average-energy games (full version).
CoRR, 2015

Average-energy games.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Pure Nash Equilibria in Concurrent Deterministic Games.
Logical Methods in Computer Science, 2015

On the optimal reachability problem in weighted timed automata and games.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

On the Value Problem in Weighted Timed Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Lower-bound-constrained runs in weighted timed automata.
Perform. Eval., 2014

Shrinking timed automata.
Inf. Comput., 2014

Nash Equilibria in Symmetric Games with Partial Observation.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Stochastic Timed Automata.
Logical Methods in Computer Science, 2014

Mixed Nash Equilibria in Concurrent Terminal-Reward Games.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Averaging in LTL.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Quantitative Verification of Weighted Kripke Structures.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Emptiness and Universality Problems in Timed Automata with Positive Frequency.
CoRR, 2013

Robustness in Timed Automata.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Robust Controller Synthesis in Timed Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
On termination and invariance for faulty channel machines.
Formal Asp. Comput., 2012

Lower-Bound Constrained Runs in Weighted Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Almost-Sure Model-Checking of Reactive Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Robust Reachability in Timed Automata: A Game-Based Approach.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Concurrent Games with Ordered Objectives.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.
Journal of Logic, Language and Information, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
CoRR, 2011

Quantitative analysis of real-time systems using priced timed automata.
Commun. ACM, 2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Shrinking Timed Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Nash Equilibria in Concurrent Games with Büchi Objectives.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Robust Model-Checking of Timed Automata via Pumping in Channel Machines.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Timed Automata Can Always Be Made Implementable.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
On the expressiveness of TPTL and MTL.
Inf. Comput., 2010

O-Minimal Hybrid Reachability Games
Logical Methods in Computer Science, 2010

Timed automata with observers under energy constraints.
Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010

Computing Rational Radical Sums in Uniform TC^0.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Nash Equilibria for Reachability Objectives in Multi-player Timed Games.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Undecidability Results for Timed Automata with Silent Transitions.
Fundam. Inform., 2009

Model-checking Timed Temporal Logics.
Electr. Notes Theor. Comput. Sci., 2009

Weighted o-minimal hybrid systems.
Ann. Pure Appl. Logic, 2009

Reachability in Stochastic Timed Games.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

When Are Timed Automata Determinizable?
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Measuring Permissivity in Finite Games.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Model Checking One-Clock Priced Timed Automata.
Logical Methods in Computer Science, 2008

Timed Petri nets and timed automata: On the discriminating power of zeno sequences.
Inf. Comput., 2008

Optimal infinite scheduling for multi-priced timed automata.
Formal Methods in System Design, 2008

Model Checking One-clock Priced Timed Automata
CoRR, 2008

On Termination for Faulty Channel Machines
CoRR, 2008

On Termination for Faulty Channel Machines.
Proceedings of the STACS 2008, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On Expressiveness and Complexity in Real-Time Model Checking.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Analysis of Timed Automata via Channel Machines.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Infinite Runs in Weighted Timed Automata with Energy Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design, 2007

The Cost of Punctuality.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Probabilistic and Topological Semantics for Timed Automata.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Model-Checking One-Clock Priced Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Costs Are Expensive!
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

2006
Lower and upper bounds in zone-based abstractions of timed automata.
STTT, 2006

Improved undecidability results on weighted timed automata.
Inf. Process. Lett., 2006

Weighted Timed Automata: Model-Checking and Games.
Electr. Notes Theor. Comput. Sci., 2006

On the Control of Timed and Hybrid Systems.
Bulletin of the EATCS, 2006

Control in o-minimal Hybrid Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Robust Model-Checking of Linear-Time Properties in Timed Automata.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Almost Optimal Strategies in One Clock Priced Timed Games.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Controller Synthesis for MTL Specifications.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Timed Temporal Logics for Abstracting Transient States.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Timed Unfoldings for Networks of Timed Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Extended Timed Automata and Time Petri Nets.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005
On Conciseness of Extensions of Timed Automata.
Journal of Automata, Languages and Combinatorics, 2005

Synthesis of Optimal Strategies Using HyTech.
Electr. Notes Theor. Comput. Sci., 2005

On the Expressiveness of TPTL and MTL.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Fault Diagnosis Using Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

A New Modality for Almost Everywhere Properties in Timed Automata.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Modal Logics for Timed Control.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Updatable timed automata.
Theor. Comput. Sci., 2004

Forward Analysis of Updatable Timed Automata.
Formal Methods in System Design, 2004

Lower and Upper Bounds in Zone Based Abstractions of Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Staying Alive as Cheaply as Possible.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Optimal Strategies in Priced Timed Game Automata.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
The power of reachability testing for timed automata.
Theor. Comput. Sci., 2003

An algebraic approach to data languages and timed languages.
Inf. Comput., 2003

Static Guard Analysis in Timed Automata Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Untameable Timed Automata!
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Timed Control with Partial Observability.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
A Kleene/Büchi-like Theorem for Clock Languages.
Journal of Automata, Languages and Combinatorics, 2002

A logical characterization of data languages.
Inf. Process. Lett., 2002

2001
An Algebraic Characterization of Data and Timed Languages.
Proceedings of the CONCUR 2001, 2001

2000
Expressiveness of Updatable Timed Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Are Timed Automata Updatable?
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Decomposition and Composition of Timed Automata.
Proceedings of the Automata, 1999

1998
The Power of Reachability Testing for Timed Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998


  Loading...