Improvements in BDD-based reachability analysis of timed automata
From MaRDI portal
(Redirected from Improvements in BDD-based reachability analysis of timed automata)
Recommendations
- Efficient reachability analysis and refinement checking of timed automata using BDDs
- Improved BDD-based discrete analysis of timed systems
- scientific article; zbMATH DE number 2104641
- scientific article; zbMATH DE number 7297846
- Efficient verification of timed automata with BDD-like data-structures
- Improvements for the Symbolic Verification of Timed Automata
- Binary reachability analysis of discrete pushdown timed automata
- The power of reachability testing for timed automata
- Bounded model checking for timed automata
Cited in
(9)- Model checking for probabilistic timed automata
- Improving search order for reachability testing in timed automata
- Improvement of a reachability analysis algorithm for real-time systems
- Improvements for the Symbolic Verification of Timed Automata
- Efficient verification of timed automata with BDD-like data-structures
- Efficient reachability analysis and refinement checking of timed automata using BDDs
- Can decision diagrams overcome state space explosion in real-time verification?
- Performance analysis of probabilistic timed automata using digital clocks
- A process algebraic framework for specification and validation of real-time systems
This page was built for publication: Improvements in BDD-based reachability analysis of timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763979)