Validation of Stochastic Systems
DOI10.1007/B98484zbMATH Open1203.68101OpenAlexW657718082MaRDI QIDQ5325845FDOQ5325845
Authors: Philippe Schnoebelen 
Publication date: 24 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98484
Recommendations
- scientific article; zbMATH DE number 1759620
- scientific article; zbMATH DE number 1929967
- scientific article; zbMATH DE number 2038771
- Quantitative analysis of probabilistic lossy channel systems
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Using forward reachability analysis for verification of lossy channel systems
- scientific article; zbMATH DE number 1956509
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- Probabilistic verification of communication protocols
- Simulating perfect channels with probabilistic lossy channels
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (19)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- \(\pi\)-calculus with noisy channels
- An analytical model for end-to-end communication channel over PLCN based on QBDs
- Proof of the Outage Probability Conjecture for MISO Channels
- Simulating perfect channels with probabilistic lossy channels
- Timed lossy channel systems
- Title not available (Why is that?)
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Title not available (Why is that?)
- Using forward reachability analysis for verification of lossy channel systems
- Quantitative analysis of probabilistic lossy channel systems
- A note on the attractor-property of infinite-state Markov chains
- Verification of probabilistic systems with faulty communication
- Computable fixpoints in well-structured symbolic model checking
- Title not available (Why is that?)
- Mixing Lossy and Perfect Fifo Channels
This page was built for publication: Validation of Stochastic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325845)
