The following pages link to Nicolas Markey (Q481096):
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)
- Improved undecidability results on weighted timed automata (Q844195) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- Mu-calculus path checking (Q1045942) (← links)
- Compositional synthesis of state-dependent switching control (Q1623281) (← links)
- On the determinization of timed systems (Q1683431) (← links)
- Timed-automata abstraction of switched dynamical systems using control invariants (Q1699229) (← links)
- Distributed synthesis of state-dependent switching control (Q1708660) (← links)
- Past is for free: On the complexity of verifying linear temporal properties with past (Q1889855) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Dependences in strategy logic (Q1987514) (← links)
- Computing maximally-permissive strategies in acyclic timed automata (Q1996019) (← links)
- Active learning of timed automata with unobservable resets (Q1996023) (← links)
- Incremental methods for checking real-time consistency (Q1996034) (← 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)
- Non-blind strategies in timed network congestion games (Q2112118) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Parameterized verification of synchronization in constrained reconfigurable broadcast networks (Q2324224) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Average-energy games (Q2413482) (← links)
- Model checking restricted sets of timed paths (Q2503042) (← links)
- Shrinking timed automata (Q2637311) (← links)
- Reachability games with relaxed energy constraints (Q2672231) (← links)
- (Q2771058) (← links)
- Robust Controller Synthesis in Timed Automata (Q2842132) (← links)
- Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past (Q2842605) (← links)
- Robust Weighted Timed Automata and Games (Q2842657) (← links)
- Concurrent Games with Ordered Objectives (Q2892779) (← links)
- (Q2908843) (← links)
- (Q2908860) (← links)
- Shrinking Timed Automata. (Q2911615) (← links)
- Nash Equilibria in Concurrent Games with Büchi Objectives (Q2911639) (← links)
- Quantified CTL: Expressiveness and Model Checking (Q2914370) (← links)
- Quantified CTL: Expressiveness and Complexity (Q2938770) (← links)
- Pure Nash Equilibria in Concurrent Deterministic Games (Q2941757) (← links)
- Language Preservation Problems in Parametric Timed Automata (Q2945580) (← links)
- Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels (Q2945582) (← links)
- (Q2978507) (← 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)
- 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)
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited (Q3172910) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
