scientific article; zbMATH DE number 1418454
From MaRDI portal
Recommendations
Cited in
(13)- Fair must testing for I/O automata
- Fair testing
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Probabilistic Analysis of Binary Sessions
- Formalisation of Probabilistic Testing Semantics in Coq
- Applying a testing approach to the calculus of fair ambients
- Algebraic theory of probabilistic processes.
- Explicit fairness in testing semantics
- Fair testing and stubborn sets
- Fair \(\pi\)
- Targeted testing for bias in order assignment, with an application to Texas election ballots
- Divergence and fair testing
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 Q4942011)