The following pages link to Thomas Brihaye (Q520341):
Displaying 50 items.
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Improved undecidability results on weighted timed automata (Q844195) (← links)
- Simple strategies for Banach-Mazur games and sets of probability 1 (Q897645) (← links)
- Cell decomposition and dimension function in the theory of closed ordered differential fields (Q1023052) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Decisiveness of stochastic systems and its application to hybrid models (Q2105467) (← links)
- \textsc{MightyL}: a compositional translation from MITL to timed automata (Q2151264) (← links)
- On the termination of dynamics in sequential games (Q2182736) (← links)
- On the optimal reachability problem of weighted timed automata (Q2385195) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- On model-checking timed automata with stopwatch observers (Q2492187) (← links)
- On MITL and Alternating Timed Automata (Q2842659) (← links)
- Subgame Perfection for Equilibria in Quantitative Reachability Games (Q2892777) (← links)
- Stochastic Timed Automata (Q2938760) (← links)
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (Q3012924) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- Antichain-Based QBF Solving (Q3172913) (← links)
- Adding Negative Prices to Priced Timed Games (Q3190143) (← links)
- (Q3384168) (← links)
- (Q3384875) (← links)
- Multiplayer Cost Games with Simple Nash Equilibria (Q3455836) (← links)
- Timed Concurrent Game Structures (Q3525654) (← links)
- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
- Equilibria in Quantitative Reachability Games (Q3569732) (← links)
- ATL with Strategy Contexts and Bounded Memory (Q3605522) (← links)
- When Are Timed Automata Determinizable? (Q3638084) (← links)
- Analysing Decisive Stochastic Processes (Q4598242) (← links)
- Real-Time Synthesis is Hard! (Q4603562) (← links)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games (Q4913770) (← links)
- (Q4992504) (← links)
- (Q4998486) (← links)
- (Q5021008) (← links)
- (Q5101350) (← links)
- (Q5140263) (← links)
- (Q5141616) (← links)
- Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points (Q5166676) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- O-Minimal Hybrid Reachability Games (Q5190321) (← links)
- (Q5275374) (← links)
- (Q5275375) (← links)
- Hybrid Systems: Computation and Control (Q5307470) (← links)
- (Q5351977) (← links)
- (Q5357711) (← links)
- (Q5387709) (← links)
- Minimum-Time Reachability in Timed Games (Q5428862) (← links)
- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! (Q5434499) (← links)
