Her main research concerns Automaton, Timed automaton, Algorithm, Theoretical computer science and Decidability. Her Automaton study combines topics from a wide range of disciplines, such as Finite-state machine and Reachability. Her studies in Timed automaton integrate themes in fields like Discrete mathematics and Theory of computation.
Her Algorithm study integrates concerns from other disciplines, such as Value, Reactive system, Semantics and Mathematical optimization. Her studies deal with areas such as State, Real-time computing, Range, Optimization problem and Data structure as well as Theoretical computer science. Her Undecidable problem study, which is part of a larger body of work in Decidability, is frequently linked to Abstract family of languages, Comparison of multi-paradigm programming languages and Ontology language, bridging the gap between disciplines.
Patricia Bouyer mostly deals with Automaton, Theoretical computer science, Timed automaton, Decidability and Discrete mathematics. The various areas that she examines in her Automaton study include Algorithm, Model checking, Reachability and Petri net. Patricia Bouyer focuses mostly in the field of Theoretical computer science, narrowing it down to matters related to State and, in some cases, Protocol and Timed game automata.
Her biological study spans a wide range of topics, including Deterministic automaton, Semantics, Mobile automaton, Automata theory and ω-automaton. Patricia Bouyer interconnects Control theory and Hybrid system in the investigation of issues within Decidability. Her Discrete mathematics research is multidisciplinary, relying on both Nash equilibrium and Combinatorics.
Her scientific interests lie mostly in Theoretical computer science, Reachability, Decidability, Automaton and Discrete mathematics. Her work on Model checking as part of general Theoretical computer science study is frequently linked to Abstraction, bridging the gap between disciplines. The study incorporates disciplines such as Undirected graph, Undecidable problem and Constant in addition to Reachability.
Patricia Bouyer works mostly in the field of Decidability, limiting it down to topics relating to Mathematical optimization and, in certain cases, Theory of computation. In the field of Automaton, her study on Timed automaton overlaps with subjects such as Formalism. Her Discrete mathematics research includes themes of Reduction and Combinatorics.
Patricia Bouyer mainly investigates Theoretical computer science, Automaton, Decidability, Reachability and Mathematical optimization. Her Theoretical computer science study incorporates themes from Algorithm and Formal methods. Her work in the fields of Algorithm, such as Timed automaton, intersects with other areas such as Forward algorithm.
The Automaton study combines topics in areas such as Control theory and State. Patricia Bouyer studied Decidability and Countable set that intersect with Petri net. Patricia Bouyer usually deals with Reachability and limits it to topics linked to Undecidable problem and PSPACE, Multi-agent system and Game semantics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Infinite Runs in Weighted Timed Automata with Energy Constraints
Patricia Bouyer;Uli Fahrenberg;Kim G. Larsen;Nicolas Markey.
formal modeling and analysis of timed systems (2008)
Improved undecidability results on weighted timed automata
Patricia Bouyer;Thomas Brihaye;Nicolas Markey.
data and knowledge engineering (2006)
Lower and upper bounds in zone-based abstractions of timed automata
Gerd Behrmann;Patricia Bouyer;Kim G. Larsen;Radek Pelánek.
International Journal on Software Tools for Technology Transfer (2006)
Optimal strategies in priced timed game automata
Patricia Bouyer;Franck Cassez;Emmanuel Fleury;Kim G. Larsen.
Lecture Notes in Computer Science (2004)
Forward Analysis of Updatable Timed Automata
formal methods (2004)
Updatable timed automata
Patricia Bouyer;Catherine Dufourd;Emmanuel Fleury;Antoine Petit.
Theoretical Computer Science (2004)
Fault diagnosis using timed automata
Patricia Bouyer;Fabrice Chevalier;Deepak D'Souza.
foundations of software science and computation structure (2005)
The power of reachability testing for timed automata
Luca Aceto;Patricia Bouyer;Augusto Burgueño;Kim G. Larsen.
Theoretical Computer Science (2003)
Timed Control with Partial Observability
Patricia Bouyer;Deepak D'souza;P. Madhusudan;Antoine Petit.
computer aided verification (2003)
Static guard analysis in timed automata verification
Gerd Behrmann;Patricia Bouyer;Emmanuel Fleury;Kim G. Larsen.
tools and algorithms for construction and analysis of systems (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: