Property Driven Three-Valued Model Checking on Hybrid Automata
DOI10.1007/978-3-642-02261-6_18zbMATH Open1246.68151OpenAlexW1520155113MaRDI QIDQ3638286FDOQ3638286
Authors: Kerstin Bauer, Klaus Schneider, Raffaella Gentilini 
Publication date: 2 July 2009
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_18
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Hybrid Systems: Computation and Control
- A theory of timed automata
- Title not available (Why is that?)
- What's decidable about hybrid automata?
- O-minimal hybrid systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
Uses Software
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)
