Pages that link to "Item:Q3012937"
From MaRDI portal
The following pages link to On Reachability for Hybrid Automata over Bounded Time (Q3012937):
Displaying 15 items.
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Parameter synthesis of polynomial dynamical systems (Q2105425) (← links)
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata (Q2986719) (← links)
- Reachset Conformance Testing of Hybrid Automata (Q2988994) (← links)
- Reachability Problems for Hybrid Automata (Q3172861) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Hypervolume Approximation in Timed Automata Model Checking (Q3510836) (← links)
- The Discrete Time Behaviour of Restricted Linear Hybrid Automata (Q4907866) (← links)
- (Q4953395) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure (Q5346080) (← 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)
