Reachability results for timed automata with unbounded data structures (Q707597)

From MaRDI portal
Revision as of 21:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Reachability results for timed automata with unbounded data structures
scientific article

    Statements

    Reachability results for timed automata with unbounded data structures (English)
    0 references
    0 references
    0 references
    8 October 2010
    0 references
    0 references
    systems of data management timed automata
    0 references
    0 references
    0 references
    0 references