Pages that link to "Item:Q5121268"
From MaRDI portal
The following pages link to Why Liveness for Timed Automata Is Hard, and What We Can Do About It (Q5121268):
Displaying 5 items.
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Iterative bounded synthesis for efficient cycle detection in parametric timed automata (Q2044207) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Efficient convex zone merging in parametric timed automata (Q2112120) (← links)