The following pages link to Jean-François Raskin (Q453497):
Displaying 50 items.
- (Q236081) (redirect page) (← links)
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- On regions and zones for event-clock automata (Q487253) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Safe learning for near-optimal scheduling (Q832074) (← links)
- Active learning of sequential transducers with side information about the domain (Q832921) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- A pattern logic for automata with outputs (Q1622976) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Pareto curves of multidimensional mean-payoff games (Q1702894) (← links)
- Fixed point guided abstraction refinement for alternating automata (Q1959653) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Lifted model checking for relational MDPs (Q2102421) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Partial solvers for generalized parity games (Q2330591) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- On the optimal reachability problem of weighted timed automata (Q2385195) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- On model-checking timed automata with stopwatch observers (Q2492187) (← links)
- Model checking restricted sets of timed paths (Q2503042) (← links)
- Almost ASAP semantics: from timed models to timed implementations (Q2576589) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Well-structured languages (Q2641880) (← links)
- Correction to: ``Reactive synthesis without regret'' (Q2675812) (← links)
- (Q2722062) (← links)
- Non-Zero Sum Games for Reactive Synthesis (Q2798706) (← links)
- ω-Petri Nets: Algorithms and Complexity (Q2805418) (← links)
- Optimal Bounds for Multiweighted and Parametrised Energy Games (Q2842640) (← links)
- (Q2847413) (← links)
- Generalized Mean-payoff and Energy Games (Q2908881) (← links)
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (Q2965484) (← links)
- Finite-Valued Weighted Automata. (Q2978508) (← links)
- Quantitative games with interval objectives (Q2978528) (← links)
- Multiple-environment Markov decision processes (Q2978542) (← links)
- Energy and mean-payoff timed games (Q2986981) (← links)
- On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- (Q3172532) (← links)
- Event Clock Automata: From Theory to Practice (Q3172852) (← links)
- Reachability Problems for Hybrid Automata (Q3172861) (← links)
- Antichain-Based QBF Solving (Q3172913) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
