Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
48550/ARXIV.2408.14701
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A sound and complete diagrammatic axiomatisation of behavioural distance is given for nondeterministic processes via string diagrams over Milner's charts.
citing papers explorer
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
-
A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
A sound and complete diagrammatic axiomatisation of behavioural distance is given for nondeterministic processes via string diagrams over Milner's charts.