Pages that link to "Item:Q1079944"
From MaRDI portal
The following pages link to Verification of multiprocess probabilistic protocols (Q1079944):
Displayed 12 items.
- Probabilistic verification of communication protocols (Q916356) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- A compositional framework for fault tolerance by specification transformation (Q1330423) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- The compositional construction of Markov processes II (Q3006162) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS (Q4820140) (← links)