Simulating perfect channels with probabilistic lossy channels

DOI10.1016/j.ic.2004.12.001zbMath1073.68058OpenAlexW2159247347MaRDI QIDQ1776399

S. Purushothaman Iyer, Bengt Jonsson, Christel Baier, Parosh Aziz Abdulla

Publication date: 12 May 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.12.001

zbMATH Keywords

infinite-state system

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Probabilistic total store ordering ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness ⋮ Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems ⋮ Verification of probabilistic systems with faulty communication

Cites Work

• Undecidable verification problems for programs with unreliable channels
• Verifying programs with unreliable channels
• The Essential Completeness of the Class of Generalized Sequential Probability Ratio Tests
• On Communicating Finite-State Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simulating perfect channels with probabilistic lossy channels