Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4536611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable verification problems for programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable channels are easier to verify than perfect channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonprimitive recursive complexity and undecidability for Petri net equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714450 / rank
 
Normal rank

Revision as of 10:21, 5 June 2024

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