The following pages link to Frédéric Herbreteau (Q209126):
Displaying 22 items.
- Better abstractions for timed automata (Q342707) (← links)
- Efficient emptiness check for timed Büchi automata (Q453519) (← links)
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Using non-convex approximations for efficient analysis of timed automata (Q2911614) (← links)
- Improving Search Order for Reachability Testing in Timed Automata (Q2945591) (← links)
- Better Abstractions for Timed Automata (Q2986813) (← links)
- (Q3044342) (← links)
- Coarse Abstractions Make Zeno Behaviours Difficult to Detect (Q3090824) (← links)
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels (Q3190124) (← links)
- Acceleration of Affine Hybrid Transformations (Q3457778) (← links)
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It (Q4636598) (← links)
- Reachability of Communicating Timed Processes (Q4910413) (← links)
- Coarse abstractions make Zeno behaviours difficult to detect (Q4913769) (← links)
- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata (Q4931294) (← links)
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It (Q5121268) (← links)
- The Power of Hybrid Acceleration (Q5756730) (← links)
- Unfolding Concurrent Well-Structured Transition Systems (Q5758140) (← links)
- Computer Aided Verification (Q5900679) (← links)
- Application of partial-order methods to reactive programs with event memorization (Q5946210) (← links)
- Checking timed Büchi automata emptiness using the local-time semantics (Q6587118) (← links)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (Q6649454) (← links)
