Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 14-minute conference presentation that introduces a general mathematical framework for temporal inference in probabilistic programs. Learn how researchers from the National Institute of Informatics and Radboud University developed a unifying approach to product constructions that enables computation of likelihood for execution traces satisfying temporal properties. Discover the key insight that both systems and temporal properties can be modeled as coalgebras, with product constructions serving as distributive laws in this categorical context. Examine the sufficient condition for correctness that enables product construction use in temporal inference, and see how this framework recovers existing approaches including partial expected rewards in Markov reward models, resource-sensitive reachability analysis, and weighted optimization problems. Understand the practical demonstration through a new instance involving weighted programs and weighted temporal properties, showcasing the scalability of this mathematical approach to quantitative temporal reasoning.
