Pages that link to "Item:Q436418"
From MaRDI portal
The following pages link to Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418):
Displaying 9 items.
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- PTIME parametric verification of safety properties for reasonable linear hybrid automata (Q1949771) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata (Q2986715) (← links)
- Crossing the Bridge between Similar Games (Q3172850) (← links)
- Computer Aided Verification (Q5312908) (← links)
- Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)
- Timed automata verification and synthesis via finite automata learning (Q6536137) (← links)