Probabilistic predicate transformers. II: Partially observable probability
From MaRDI portal
Cites work
- A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
- A recipe for state-and-effect triangles
- A single complete rule for data refinement
- Abstract hidden Markov models: a monadic account of quantitative information flow
- Abstraction, Refinement and Proof for Probabilistic Systems
- An axiomatic basis for computer programming
- An expectation-transformer model for probabilistic temporal logic
- Bayesian Estimation and Prediction Using Asymmetric Loss Functions
- Categorical Information Flow
- Category theoretic models of data refinement
- Chain-complete posets and directed sets with applications
- Combining probabilistic and non-deterministic choice via weak distributive laws
- Compositional closure for Bayes risk in probabilistic noninterference
- Data Refinement
- Differential Privacy
- Elementary probability theory in the Eindhoven style
- Encoding, decoding and data refinement
- EWD1300: The notational conventions I adopted, and why
- Exercises in Quantifier Manipulation
- Forward and backward simulations for partially observable probability
- Forward and backward simulations. I. Untimed Systems
- Generic Forward and Backward Simulations
- Generic weakest precondition semantics from monads enriched with order
- Healthiness from Duality
- Hidden-Markov program algebra with iteration
- scientific article; zbMATH DE number 6712178 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3843129 (Why is no real title available?)
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 3943003 (Why is no real title available?)
- scientific article; zbMATH DE number 3688676 (Why is no real title available?)
- scientific article; zbMATH DE number 3733226 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1330450 (Why is no real title available?)
- scientific article; zbMATH DE number 1469900 (Why is no real title available?)
- scientific article; zbMATH DE number 1487738 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 2087445 (Why is no real title available?)
- scientific article; zbMATH DE number 1841809 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- scientific article; zbMATH DE number 3068103 (Why is no real title available?)
- Hyper normalisation and conditioning for discrete probability distributions
- Hypernormalisation in an abstract setting
- Monads, partial evaluations, and rewriting
- On the expressive power of schedulers in distributed probabilistic systems
- On the Foundations of Quantitative Information Flow
- Ordered cones and approximation
- Partially observable Markov decision processes: a geometric technique and analysis
- Planning and acting in partially observable stochastic domains
- Power domains
- Power domains and second-order predicates
- Predicate transformers for extended probability and non-determinism
- Premonoidal categories and notions of computation
- Prespecification in data refinement
- Principles of verification: cycling the probabilistic landscape. Essays dedicated to Joost-Pieter Katoen on the occasion of his 60th birthday. Part I
- Probabilistic datatypes
- Refinement Calculus
- Representable Markov categories and comparison of statistical experiments in categorical probability
- Semantic domains for combining probability and non-determinism
- Structure and Use of ALGOL 60
- The Hoare logic of concurrent programs
- The Category-Theoretic Solution of Recursive Domain Equations
- The duality of state and observation in probabilistic transition systems
- The science of quantitative information flow
- The shadow knows: refinement and security in sequential programs
- The Thousand-and-One Cryptographers
- The Vietoris monad and weak distributive laws
- Universal coalgebra: A theory of systems
- Weak upper topologies and duality for cones
This page was built for publication: Probabilistic predicate transformers. II: Partially observable probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347251)
