Polynomial interrupt timed automata: verification and expressiveness (Q2662502)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial interrupt timed automata: verification and expressiveness
scientific article

    Statements

    Polynomial interrupt timed automata: verification and expressiveness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2021
    0 references
    timed systems
    0 references
    verification
    0 references
    cylindrical decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references