SAT-based reachability checking for timed automata with discrete data
From MaRDI portal
Recommendations
Cited in
(16)- Augmenting the discrete timed automaton with other data structures.
- Fault localization of timed automata using maximum satisfiability
- Configurable verification of timed automata with discrete variables
- Verification for Timed Automata extended with Unbounded Discrete Data Structures
- A SAT-based technique to analyse networks of finite automata
- scientific article; zbMATH DE number 1982208 (Why is no real title available?)
- scientific article; zbMATH DE number 2064231 (Why is no real title available?)
- scientific article; zbMATH DE number 2064232 (Why is no real title available?)
- scientific article; zbMATH DE number 1773082 (Why is no real title available?)
- scientific article; zbMATH DE number 2104641 (Why is no real title available?)
- SMT-based reachability analysis for simply-timed systems
- scientific article; zbMATH DE number 5033900 (Why is no real title available?)
- Formal Modeling and Analysis of Timed Systems
- Lazy Reachability Checking for Timed Automata with Discrete Variables
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- An approximation-based incremental SMT approach for diagnosability analysis of real-time systems
This page was built for publication: SAT-based reachability checking for timed automata with discrete data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422299)
