Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078)

From MaRDI portal
Revision as of 10:27, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Verifying lossy channel systems has nonprimitive recursive complexity.
scientific article

    Statements

    Verifying lossy channel systems has nonprimitive recursive complexity. (English)
    0 references
    0 references
    21 January 2003
    0 references
    Verification of infinite-state systems
    0 references
    Communication protocols
    0 references
    Program correctness
    0 references
    Formal methods
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references