Towards efficient partition refinement for checking reachability in timed automata
From MaRDI portal
Recommendations
Cited in
(5)- Partitioned PLTL model-checking for refined transition systems
- scientific article; zbMATH DE number 1799517 (Why is no real title available?)
- Improvement of a reachability analysis algorithm for real-time systems
- scientific article; zbMATH DE number 2064231 (Why is no real title available?)
- Slicing of timed automata with discrete data
This page was built for publication: Towards efficient partition refinement for checking reachability in timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717496)