activity
20162024
most citedJ-P: MDP. FP. PP.: Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs (Technical Report)

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.PLShow all

1 paper · 1 filter

cs.PL2018

How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen +1

Bayesian networks (BNs) are probabilistic graphical models for describing complex joint probability distributions. The main problem for BNs is inference: Determine the probability…