Verification of multiprocess probabilistic protocols
From MaRDI portal
Recommendations
- Probabilistic verification of communication protocols
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Verification of Probabilistic Programs
- Verification of probabilistic systems with faulty communication
- scientific article; zbMATH DE number 1956504
- Parameterized verification of many identical probabilistic timed processes
- On verification of parallel message-passing processes
- Message-passing algorithms for the verification of distributed protocols
Cites work
- scientific article; zbMATH DE number 3829244 (Why is no real title available?)
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 3755842 (Why is no real title available?)
- scientific article; zbMATH DE number 3800906 (Why is no real title available?)
- Proving Liveness Properties of Concurrent Programs
- Reasoning with time and chance
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system
- Termination of Probabilistic Concurrent Program
- The choice coordination problem
Cited in
(31)- Fair termination for parameterized probabilistic concurrent systems
- EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
- Probabilistic verification of communication protocols
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- Using Probabilistic Kleene Algebra for Protocol Verification
- Symbolic model checking for probabilistic processes
- The compositional construction of Markov processes. II
- Testing preorders for probabilistic processes can be characterized by simulations
- A temporal logic for proving properties of topologically general executions
- A space-efficient simulation algorithm on probabilistic automata
- Model checking probabilistic systems
- scientific article; zbMATH DE number 2087627 (Why is no real title available?)
- Compositional verification of randomized distributed algorithms
- Probabilistic verification
- A logic for reasoning about time and reliability
- A compositional framework for fault tolerance by specification transformation
- Generic emptiness check for fun and profit
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Randomized dining philosophers without fairness assumption
- Logic-based verification of the distributed dining philosophers protocol
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Deciding bisimilarity and similarity for probabilistic processes.
- Finding the closed partition of a planar graph
- Modular verification of protocol equivalence in the presence of randomness
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- scientific article; zbMATH DE number 4080970 (Why is no real title available?)
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- scientific article; zbMATH DE number 1956507 (Why is no real title available?)
- scientific article; zbMATH DE number 7649941 (Why is no real title available?)
This page was built for publication: Verification of multiprocess probabilistic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079944)
