Property Driven Three-Valued Model Checking on Hybrid Automata
From MaRDI portal
Recommendations
- A bounded model checker for three-valued abstractions of concurrent software systems
- Instantiation reduction in iterative parameterised three-valued model checking
- scientific article; zbMATH DE number 2102712
- Model checking algorithms for hyperproperties (invited paper)
- 2-valued and 3-valued abstraction-refinement in model checking
- Constraint reusing and k-induction for three-valued bounded model checking
Cites work
- A theory of timed automata
- Computer Aided Verification
- scientific article; zbMATH DE number 1303067 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1956633 (Why is no real title available?)
- scientific article; zbMATH DE number 1507210 (Why is no real title available?)
- scientific article; zbMATH DE number 1798190 (Why is no real title available?)
- scientific article; zbMATH DE number 2085344 (Why is no real title available?)
- scientific article; zbMATH DE number 1444359 (Why is no real title available?)
- scientific article; zbMATH DE number 2242595 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- O-minimal hybrid systems.
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
- What's decidable about hybrid automata?
This page was built for publication: Property Driven Three-Valued Model Checking on Hybrid Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638286)