The following pages link to Patricia Bouyer (Q481095):
Displaying 50 items.
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Improved undecidability results on weighted timed automata (Q844195) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- Games on graphs with a public signal monitoring (Q1653014) (← links)
- On the determinization of timed systems (Q1683431) (← links)
- Timed-automata abstraction of switched dynamical systems using control invariants (Q1699229) (← links)
- A logical characterization of data languages. (Q1853115) (← links)
- Forward analysis of updatable timed automata (Q1878925) (← links)
- Updatable timed automata (Q1885906) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Dependences in strategy logic (Q1987514) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Decisiveness of stochastic systems and its application to hybrid models (Q2105467) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Timed automata (Q2244829) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Identifiers in registers. Describing network algorithms with logic (Q2289067) (← links)
- On the optimal reachability problem of weighted timed automata (Q2385195) (← links)
- Average-energy games (Q2413482) (← links)
- Optimal infinite scheduling for multi-priced timed automata (Q2475633) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- Shrinking timed automata (Q2637311) (← links)
- (Q2754107) (← links)
- Robust Controller Synthesis in Timed Automata (Q2842132) (← links)
- Robust Weighted Timed Automata and Games (Q2842657) (← links)
- Synthesis of optimal strategies using \textsc{HyTech} (Q2849560) (← links)
- Weighted timed automata: model-checking and games (Q2851314) (← links)
- Concurrent Games with Ordered Objectives (Q2892779) (← links)
- Computing rational radical sums in uniform \(\mathrm{TC}^0\) (Q2908860) (← links)
- Shrinking timed automata (Q2911615) (← links)
- Nash equilibria in concurrent games with Büchi objectives (Q2911639) (← links)
- Stochastic Timed Automata (Q2938760) (← links)
- Pure Nash Equilibria in Concurrent Deterministic Games (Q2941757) (← links)
- Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels (Q2945582) (← links)
- Mixed Nash Equilibria in Concurrent Terminal-Reward Games (Q2978527) (← links)
- Timed automata with observers under energy constraints (Q2985866) (← links)
- Bounding Average-Energy Games (Q2988367) (← links)
- Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (Q3012924) (← links)
- Timed Automata Can Always Be Made Implementable (Q3090823) (← links)
- Robust Reachability in Timed Automata: A Game-Based Approach (Q3167005) (← links)
- Robust Model-Checking of Timed Automata via Pumping in Channel Machines (Q3172846) (← links)
