Rewards and expected reachability for DTMCs

Rewards and expected reachability for DTMCs

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=SaM2qQY_57U


Duration: 15:39
105 views
1

Gethin Norman (University of Glasgow)
https://simons.berkeley.edu/talks/probabilistic-systems
Theoretical Foundations of Computer Systems Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2021-01-20Logic in Computer Science with a Strong Bias Towards Automata 2
2021-01-19Introduction to Automata on Infinite Words 3
2021-01-19Computing Reachability Probabilities
2021-01-19Deductive Methods for Verification and Synthesis in Hybrid Systems
2021-01-19Verifiable Reinforcement Learning
2021-01-19Correct-by-construction Synthesis of Hierarchical Control Protocols
2021-01-19Probabilistic Reachability for MDPs
2021-01-19Probabilistic Systems Part 2: Markov decision processes
2021-01-19Probabilistic Systems Part 1: discrete time Markov chains
2021-01-19Probabilistic reachability
2021-01-19Rewards and expected reachability for DTMCs
2021-01-19Probabilistic Systems Introductions
2021-01-19Introduction to Automata on Infinite Words 6
2021-01-19Introduction to Automata on Infinite Words 5
2021-01-19Introduction to Automata on Infinite Words 2
2021-01-19Introduction to Automata on Infinite Words 4
2021-01-19Introduction to Automata on Infinite Words 1
2021-01-15Computation Over the Noisy Broadcast Channel with Malicious Parties
2021-01-15Erasure-Resilient Sublinear-Time Graph Algorithms
2021-01-15How to Sell Information Optimally: an Algorithmic Study
2021-01-15Distributed load balancing: a new framework and improved guarantees


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Theoretical Foundations of Computer Systems Boot Camp
Gethin Norman