Pages that link to "Item:Q2864156"
From MaRDI portal
The following pages link to Remarks on testing probabilistic processes (Q2864156):
Displaying 18 items.
- On real reward testing (Q407446) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Testing preorders for probabilistic processes. (Q1854314) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Real-reward testing for probabilistic processes (Q2453107) (← links)
- Semi-decidability of may, must and probabilistic testing in a higher-type setting (Q2805159) (← links)
- Probabilistic barbed congruence (Q2870293) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- Testing Finitary Probabilistic Processes (Q3184679) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- Probabilistic Analysis of Binary Sessions (Q5089279) (← links)
- (Q5151036) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)