Hardness of preorder checking for basic formalisms (Q650916)

From MaRDI portal
Revision as of 18:05, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hardness of preorder checking for basic formalisms
scientific article

    Statements

    Hardness of preorder checking for basic formalisms (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    behavioral preorders and equivalences
    0 references
    preorder and equivalence checking
    0 references
    non-flat finite-state systems
    0 references
    timed automata
    0 references
    computational complexity
    0 references

    Identifiers