Effective definability of the reachability relation in timed automata (Q2338218)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Effective definability of the reachability relation in timed automata
scientific article

    Statements

    Effective definability of the reachability relation in timed automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2019
    0 references
    Presburger arithmetic
    0 references
    region automaton
    0 references
    semilinear sets
    0 references
    real-time systems
    0 references

    Identifiers

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