Model checking lossy channels systems is probably decidable

DOI10.1007/3-540-36576-1_8MaRDI QIDQ4417855zbMATH OpenFDO

Authors Nathalie Bertrand, Philippe Schnoebelen

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2620/26200120.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verifying lossy channel systems has nonprimitive recursive complexity.
• Validation of Stochastic Systems
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• Using forward reachability analysis for verification of lossy channel systems
• Reasoning about probabilistic lossy channel systems
• scientific article; zbMATH DE number 2242597
• On verifying fair lossy channel systems
• Model checking lossy vector addition systems
• Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
• Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness

Cited in

(18)

• A note on the attractor-property of infinite-state Markov chains
• Simulating perfect channels with probabilistic lossy channels
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Quantitative analysis of probabilistic lossy channel systems
• Verification of probabilistic systems with faulty communication
• Timed lossy channel systems
• Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
• Model checking lossy vector addition systems
• Verification of probabilistic systems with faulty communication
• Reasoning about probabilistic lossy channel systems
• On verifying fair lossy channel systems
• Validation of Stochastic Systems
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• Stochastic Games with Lossy Channels
• scientific article; zbMATH DE number 2242597 (Why is no real title available?)
• Concurrent stochastic lossy channel games
• About decisiveness of dynamic probabilistic models
• CSL model checking algorithms for QBDs

This page was built for publication: Model checking lossy channels systems is probably decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417855)