Pages that link to "Item:Q1079944"

The following pages link to Verification of multiprocess probabilistic protocols (Q1079944):

Displaying 17 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)
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings (Q1954232) (← links)
• Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
• Markov automata with multiple objectives (Q2151241) (← links)
• On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
• A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
• The compositional construction of Markov processes II (Q3006162) (← links)
• Model Checking Probabilistic Systems (Q3176386) (← links)
• Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
• Generic Emptiness Check for Fun and Profit (Q3297604) (← links)
• Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
• (Q5875395) (← links)