Pages that link to "Item:Q5166676"
From MaRDI portal
The following pages link to Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points (Q5166676):
Displaying 6 items.
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Reachability Problems for Hybrid Automata (Q3172861) (← links)
- On a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically (Q4454754) (← links)
- What’s Decidable About Parametric Timed Automata? (Q4686606) (← links)
- Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints (Q5500564) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5897961) (← links)