Improved BDD-based discrete analysis of timed systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1324667
- Improvements for the Symbolic Verification of Timed Automata
- Efficient reachability analysis and refinement checking of timed automata using BDDs
- Symbolic model checking of timed guarded commands using difference decision diagrams
- Bounded model checking for timed systems
Cited in
(8)- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Model checking approach to automated planning
- Improvements in BDD-based reachability analysis of timed automata
- Improvements for the Symbolic Verification of Timed Automata
- scientific article; zbMATH DE number 1324666 (Why is no real title available?)
- Efficient reachability analysis and refinement checking of timed automata using BDDs
- Timed automata verification and synthesis via finite automata learning
- Timed automata verification and synthesis via finite automata learning
This page was built for publication: Improved BDD-based discrete analysis of timed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647854)