Efficient Model-Checking of Timed Automata with Clock-Restriction Diagram
No abstract available.
Related papers
- Model Checking Probabilistic Timed Automata with One or Two Clocks TACAS 2007
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams CAV 1999
- Abstraction Refinement Algorithms for Timed Automata CAV 2019
- A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation CAV 2023
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- TarTar: A Timed Automata Repair Tool CAV 2020
- Monitoring CTMCs by Multi-clock Timed Automata CAV 2018
- Automated Verification for Real-Time Systems - via Implicit Clocks and an Extended Antimirov Algorithm TACAS 2023