Semantics of probabilistic processes. An operational approach

DOI10.1007/978-3-662-45198-4MaRDI QIDQ5497245zbMATH OpenOpenAlexFDO

Authors Yuxin Deng

Publication date 3 February 2015

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

zbMATH Keywords

characteristic formulamodal logicprobabilistic bisimulationprobabilistic labelled transition systemprobabilistic simulationreduction-barbed congruencereward testingtesting semanticsweak probabilistic bisimulation

Mathematics Subject Classification ID

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

Recommendations

• Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics
• Abstraction, Refinement and Proof for Probabilistic Systems
• scientific article; zbMATH DE number 869193
• scientific article; zbMATH DE number 1209695
• Introduction to concurrency theory. Transition systems and CCS

Cited in

(14)

• SOS specifications for uniformly continuous operators
• Probabilistic divide \& congruence: branching bisimilarity
• Encoding safety in \(\mathrm{CLL}_R\)
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• Probabilistic extensions of process algebras.
• A formalized hierarchy of probabilistic system types. Proof pearl
• Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics
• A spectrum of behavioral relations over LTSs on probability distributions
• Abstraction, Refinement and Proof for Probabilistic Systems
• Bisimulations for probabilistic and quantum processes (invited paper)
• The sub-additives: a proof theory for probabilistic choice extending linear logic
• Probabilistic weak bisimulation and axiomatization for probabilistic models
• Uniform random process model revisited
• A unifying approach to probabilistic testing equivalences

This page was built for publication: Semantics of probabilistic processes. An operational approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5497245)