Improvements for the Symbolic Verification of Timed Automata
From MaRDI portal
Publication:3614852
Recommendations
- Improvements in BDD-based reachability analysis of timed automata
- Efficient reachability analysis and refinement checking of timed automata using BDDs
- scientific article; zbMATH DE number 1324667
- Improved BDD-based discrete analysis of timed systems
- Verification of timed automata via satisfiability checking
Cites work
- A theory of timed automata
- Can decision diagrams overcome state space explosion in real-time verification?
- Difference decision diagrams
- Efficient timed reachability analysis using clock difference diagrams
- Efficient verification of timed automata with BDD-like data-structures
- Formal design and analysis of a gear controller
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- Improvements in BDD-based reachability analysis of timed automata
- On discretization of delays in timed automata and digital circuits
- Theoretical Aspects of Computing – ICTAC 2005
- Uppaal in a nutshell
Cited in
(9)- Symbolic verification and analysis of discrete timed systems
- Improvements in BDD-based reachability analysis of timed automata
- On improving backwards verification of timed automata (extended abstract)
- Better abstractions for timed automata
- Symbolic Simulation-Checking of Dense-Time Automata
- Improving the verification of timed systems using influence information
- Improved BDD-based discrete analysis of timed systems
- SMT-based induction methods for timed systems
- The Power of Proofs: New Algorithms for Timed Automata Model Checking
This page was built for publication: Improvements for the Symbolic Verification of Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614852)