Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.scico.2011.07.006 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.scico.2011.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170622387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Verification of Hybrid Systems with Large Discrete State Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: HyTech: A model checker for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Linear Quantifier Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques for Networked and Distributed Systems - FORTE 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Metrics for Discrete and Continuous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Image Computation Problem in Hybrid Systems Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Reachability Analysis of Lazy Linear Hybrid Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridization methods for the analysis of nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.SCICO.2011.07.006 / rank
 
Normal rank

Latest revision as of 17:32, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
scientific article

    Statements

    Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 2012
    0 references
    verification
    0 references
    linear hybrid automata
    0 references
    symbolic representations
    0 references
    non-convex polyhedra
    0 references
    redundancy elimination
    0 references
    satisfiability modulo theories (SMT)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers