Verification of probabilistic systems with faulty communication

DOI10.1016/j.ic.2005.05.008zbMath1105.68003OpenAlexW2096610849MaRDI QIDQ2573634

Nathalie Bertrand, Philippe Schnoebelen, Parosh Aziz Abdulla, Alexander Rabinovich

Publication date: 22 November 2005

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

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

zbMATH Keywords

lossy channel systems

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (10)

When are stochastic transition systems tameable? ⋮ Value-passing CCS with noisy channels ⋮ Model checking probabilistic systems against pushdown specifications ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Quantitative analysis of probabilistic lossy channel systems ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness ⋮ A note on the attractor-property of infinite-state Markov chains

Cites Work

• Stutter-invariant temporal properties are expressible without the next-time operator
• Undecidable verification problems for programs with unreliable channels
• Measure and probability for concurrency theorists
• Simulating perfect channels with probabilistic lossy channels
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• On Communicating Finite-State Machines
• The complexity of probabilistic verification
• Model Checking Probabilistic Pushdown Automata
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification of probabilistic systems with faulty communication