Pages that link to "Item:Q2891432"
From MaRDI portal
The following pages link to A General Framework for Probabilistic Characterizing Formulae (Q2891432):
Displaying 6 items.
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- (Q5009413) (← links)
