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
- Model checking partial state spaces with 3-valued temporal logics (extended abstract).
- 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 new class of decidable hybrid systems
- A theory of timed automata
- Algorithmic algebraic model checking. I: Challenges from systems biology
- Automated symbolic reachability analysis; with application to Delta-Notch signaling automata
- Decidability and complexity results for timed automata and semi-linear hybrid automta
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Lateral inhibition through Delta-Notch signaling: A piecewise affine hybrid model
- O-minimal hybrid systems.
- Safety verification of hybrid systems by constraint propagation based abstraction refinement
- Series of abstractions for hybrid automata
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
- The theory of hybrid automata
- What will be eventually true of polynomial hybrid automata?
- 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)