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

From MaRDI portal
Revision as of 17:32, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (English)
    0 references
    author
    Werner Damm
    0 references
    Henning Dierks
    0 references
    Stefan Disch
    0 references
    Willem Hagemann
    0 references
    Florian Pigorsch
    0 references
    Christoph Scholl
    0 references
    Uwe Waldmann
    0 references
    Boris Wirtz
    0 references
    publication date
    20 July 2012
    0 references
    zbMATH Keywords
    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
    describes a project that uses
    CUDD
    0 references
    HyTech
    0 references
    PHAVer
    0 references
    CLN
    0 references
    MathSAT
    0 references
    d/dt
    0 references
    LinAIG
    0 references
    MiniSat
    0 references
    cites work
    Q4806208
    0 references
    Q3141897
    0 references
    Q4503930
    0 references
    Q3506045
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q60
    0 references
    68Q45
    0 references
    68W30
    0 references
    zbMATH DE Number
    6059159
    0 references
    OpenAlex ID
    W2170622387
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q436418&oldid=38348557"
    Powered by MediaWiki