Semantics of Probabilistic Processes

DOI10.1007/978-3-662-45198-4zbMath1315.68002OpenAlexW2495188503MaRDI QIDQ5497245

Yu-xin Deng

Publication date: 3 February 2015

Full work available at URL: https://doi.org/10.1007/978-3-662-45198-4

zbMATH Keywords

modal logicprobabilistic simulationprobabilistic bisimulationtesting semanticsweak probabilistic bisimulationcharacteristic formulareward testingprobabilistic labelled transition systemreduction-barbed congruence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

SOS specifications for uniformly continuous operators ⋮ A Formalized Hierarchy of Probabilistic System Types ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Unnamed Item ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Unnamed Item ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory

This page was built for publication: Semantics of Probabilistic Processes