scientific article; zbMATH DE number 1956504
From MaRDI portal
Publication:4417850
zbMATH Open1029.68094MaRDI QIDQ4417850FDOQ4417850
Authors: Alexander Rabinovich, Parosh A. Abdulla
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2620/26200039.htm
Title of this publication is not available (Why is that?)
Recommendations
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 (13)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Title not available (Why is that?)
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- \(\pi\)-calculus with noisy channels
- Unreliable channels are easier to verify than perfect channels
- Stochastic Games with Lossy Channels
- Simulating perfect channels with probabilistic lossy channels
- Deciding probabilistic bisimilarity over infinite-state probabilistic 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
- Verification of multiprocess probabilistic protocols
- Deterministic Models of Communication Faults
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417850)