Quantifier-free encoding of invariants for hybrid systems (Q479826): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: HyDI / 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.1007/s10703-013-0202-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074838304 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62041149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requirements Validation for Hybrid Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification in continuous time by discrete reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of nonlinear hybrid systems / 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: Symbolic reachability computation for families of linear vector fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid systems: From verification to falsification by combining motion planning and discrete search / 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: On the decidability of continuous time specification formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstractions for hybrid systems / rank
 
Normal rank

Latest revision as of 10:43, 9 July 2024

scientific article
Language Label Description Also known as
English
Quantifier-free encoding of invariants for hybrid systems
scientific article

    Statements

    Quantifier-free encoding of invariants for hybrid systems (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    0 references
    satisfiability modulo theory
    0 references
    hybrid systems
    0 references
    bounded model checking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references