Undecidable problems in unreliable computations

DOI10.1007/10719839_37MaRDI QIDQ4508393zbMATH OpenFDO

Authors Richard M. Mayr

Publication date 3 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10719839_37

zbMATH Keywords

lossy counter machinesreset Petri nets

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Undecidable problems in unreliable computations.
• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Lossy counter machines decidability cheat sheet
• scientific article; zbMATH DE number 1929967

Cited in

(18)

• Undecidable goals for completed acyclic programs
• Automatic verification of recursive procedures with one integer parameter.
• Undecidable problems in unreliable computations.
• Communication errors in the \(\pi\)-calculus are undecidable
• Handling infinitely branching well-structured transition systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Undecidability in decentralized supervision
• Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
• The decision problem of modal product logics with a diagonal, and faulty counter machines
• Undecidability over Continuous Time
• Lossy counter machines decidability cheat sheet
• Undecidability in Some Structures Related to Computation Theory
• On termination for faulty channel machines
• The Parametric Complexity of Lossy Counter Machines
• A classification of the expressive power of well-structured transition systems
• scientific article; zbMATH DE number 2242597 (Why is no real title available?)
• Undecidable verification problems for programs with unreliable channels
• Priority downward closures

This page was built for publication: Undecidable problems in unreliable computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508393)