Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
From MaRDI portal
Publication:3613069
DOI10.1007/11888116_17zbMath1225.68108OpenAlexW1508008065MaRDI QIDQ3613069
Nathalie Bertrand, Christel Baier, Philippe Schnoebelen
Publication date: 11 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11888116_17
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidable verification problems for programs with unreliable channels
- A note on the attractor-property of infinite-state Markov chains
- Verification of multiprocess probabilistic protocols
- Measure and probability for concurrency theorists
- Simulating perfect channels with probabilistic lossy channels
- Probabilistic verification
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Using forward reachability analysis for verification of lossy channel systems
- Validation of stochastic systems. A guide to current research.
- Verifying programs with unreliable channels
- A general approach to comparing infinite-state systems with their finite-state specifications
- Verification of probabilistic systems with faulty communication
- On Communicating Finite-State Machines
- The complexity of probabilistic verification
- Termination of Probabilistic Concurrent Program
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- Computer Science Logic
- Validation of Stochastic Systems
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
This page was built for publication: Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
