Pages that link to "Item:Q2911614"
From MaRDI portal
The following pages link to Using non-convex approximations for efficient analysis of timed automata (Q2911614):
Displaying 9 items.
- Better abstractions for timed automata (Q342707) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
- Configurable verification of timed automata with discrete variables (Q2120808) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Exact Incremental Analysis of Timed Automata with an SMT-Solver (Q3172851) (← links)
- Hypervolume Approximation in Timed Automata Model Checking (Q3510836) (← links)
- (Q5009444) (← links)
- Lazy Reachability Checking for Timed Automata with Discrete Variables (Q5883582) (← links)