Pages that link to "Item:Q3510839"
From MaRDI portal
The following pages link to Automatic Abstraction Refinement for Timed Automata (Q3510839):
Displayed 12 items.
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Configurable verification of timed automata with discrete variables (Q2120808) (← links)
- Abstraction based verification of stability of polyhedral switched systems (Q2178203) (← links)
- Extracting counterexamples induced by safety violation in linear hybrid systems (Q2184551) (← links)
- Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security (Q2798768) (← links)
- Stochastic Games for Verification of Probabilistic Timed Automata (Q3648833) (← links)
- Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction* (Q4989166) (← links)
- Progress-preserving Refinements of CTA (Q5009458) (← links)
- Refinement of Timing Constraints for Concurrent Tasks with Scheduling (Q5881451) (← links)
- Lazy Reachability Checking for Timed Automata with Discrete Variables (Q5883582) (← links)
- Automated repair for timed systems (Q6108434) (← links)
- Stability analysis of planar probabilistic piecewise constant derivative systems (Q6160779) (← links)