On termination and invariance for faulty channel machines (Q1941874): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Termination for Faulty Channel Machines / 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: Mixing Lossy and Perfect Fifo Channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety alternating automata on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems in unreliable computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma / rank
 
Normal rank

Latest revision as of 08:05, 6 July 2024

scientific article
Language Label Description Also known as
English
On termination and invariance for faulty channel machines
scientific article

    Statements

    On termination and invariance for faulty channel machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    channel machines
    0 references
    computational complexity
    0 references
    metric temporal logic
    0 references
    primitive recursive
    0 references
    well-structured systems
    0 references
    0 references