CONCUR
Completeness for Probabilistic Boolean Tapes
Filippo Bonchi, Cipriano Junior Cioffo
in Room Ain session CONCUR Session 11 - Quantitative Verification
(on,
Fri, 10:30, 4 talks over 90 min)
Probabilistic Boolean circuits have recently been proposed as a string-diagrammatic foundation for finite probabilistic programming. In this paper, we present a complete set of axioms for their semantics in terms of Markov kernels. Our approach is based on two intermediate results: completeness for partial Boolean circuits and completeness for probabilistic Boolean tapes, a diagrammatic language for rig categories.