Quantitative analysis of probabilistic lossy channel systems

DOI10.1016/j.ic.2005.11.004zbMath1103.68078OpenAlexW1986669897MaRDI QIDQ2495651

Alexander Rabinovich

Publication date: 30 June 2006

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

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

zbMATH Keywords

communicating finite state machinesfinite state \(\omega\)-automatonqualitative model checking problem

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

When are stochastic transition systems tameable? ⋮ Computable fixpoints in well-structured symbolic model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidable verification problems for programs with unreliable channels
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• Verification of probabilistic systems with faulty communication
• On Communicating Finite-State Machines
• Markov Chains
• The complexity of probabilistic verification
• Validation of Stochastic Systems
• Ordering by Divisibility in Abstract Algebras
• Well-structured transition systems everywhere!

This page was built for publication: Quantitative analysis of probabilistic lossy channel systems