Towards a Quantitative Operational Semantics
Friedrich-Alexander-Universität Erlangen-Nürnberg · 159 slides.
The theorem of Turi and Plotkin makes bisimilarity a congruence for GSOS laws over sets. Over quasi-pseudometric spaces, the same laws bound the distance of two programs in a context by a modulus of the distances of their parts. Hausdorff distances bring back bisimilarity and similarity, and for programs that flip coins the rules compute the moduli, exactly for the standard process algebra.