The following pages link to Gilles Geeraerts (Q487252):
Displaying 33 items.
- On regions and zones for event-clock automata (Q487253) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- \textsc{MightyL}: a compositional translation from MITL to timed automata (Q2151264) (← links)
- On the termination of dynamics in sequential games (Q2182736) (← links)
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- Well-structured languages (Q2641880) (← links)
- ω-Petri Nets: Algorithms and Complexity (Q2805418) (← links)
- On MITL and Alternating Timed Automata (Q2842659) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- Event Clock Automata: From Theory to Practice (Q3172852) (← links)
- Adding Negative Prices to Priced Timed Games (Q3190143) (← links)
- (Q3384168) (← links)
- Synthesising Succinct Strategies in Safety and Reachability Games (Q3447698) (← links)
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets (Q3510790) (← links)
- ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS (Q3552518) (← links)
- Safraless Procedures for Timed Specifications (Q3588081) (← links)
- Realizability of Real-Time Logics (Q3648828) (← links)
- Real-Time Synthesis is Hard! (Q4603562) (← links)
- Lattice-Valued Binary Decision Diagrams (Q4931290) (← links)
- (Q5090977) (← links)
- (Q5101350) (← links)
- Admissiblity in Concurrent Games (Q5111455) (← links)
- Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points (Q5166676) (← links)
- (Q5275374) (← links)
- (Q5275375) (← links)
- ω-Petri Nets (Q5300865) (← links)
- (Q5357711) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465861) (← links)
- On MITL and Alternating Timed Automata over Infinite Words (Q5500555) (← links)
- Computer Aided Verification (Q5716580) (← links)
- Dynamics on Games: Simulation-Based Techniques and Applications to Routing (Q5875670) (← links)
- Timed-automata-based verification of MITL over signals (Q6486425) (← links)
