Probabilistic Extensions of Process Algebras

By B. Jonsson, Wang Yi, Kim Guldstrand Larsen. 2001

171 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Proving Differential Privacy via Probabilistic Couplings (2016, neutral): “2013; Barthe and Olmedo 2013), a generalization of probabilistic liftings used in probabilistic process algebra (Jonsson et al. 2001).”
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation (2011, background): “An adequate logic for probabilistic bisimulation in a setting similar to our pLTSs has been studied in [33, 49].”
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (2013, background): “When δ = 0 and f satisfies the identity of indiscernibles, the (f, δ)-lifting is logically equivalent to the exact lifting from [19].”
Computer-Aided Security Proofs for the Working Cryptographer (2011, background): “The lifting of a relation to a distribution is defined as a max-cut min-flow problem, in the style of [19].”
Principles of model checking (2008, methodology): “Simulation and bisimulation relations, as well as the use of MDP-like models as semantical model for process algebras, can be found in the survey paper by Jonsson, Yi, and Larsen [228].”
Formal certification of code-based cryptographic proofs (2009, methodology): “In contrast to the definition given by Jonsson et al. [2001], the definition above makes sense even when the distributions do not have a countable support.”
Probabilistic relational reasoning for differential privacy (2012, background): “[20] B. Jonsson, W. Yi, and K. G. Larsen.”