3 papers
cs.LO2026
CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems (Technical Report)
Roberto Pettinau, Christoph Matheja
We study model checking algorithms for infinite families of finite-state labeled transition systems against temporal properties written in CTL*. Such families arise, for example, a…
cs.AI2024
What should be observed for optimal reward in POMDPs?
Alyzia-Maria Konsta, Alberto Lluch Lafuente, Christoph Matheja
Partially observable Markov Decision Processes (POMDPs) are a standard model for agents making decisions in uncertain environments. Most work on POMDPs focuses on synthesizing stra…
cs.PL2024
Data Petri Nets meet Probabilistic Programming (Extended version)
Martin Kuhn, Joscha Grüger, Christoph Matheja +1
Probabilistic programming (PP) is a programming paradigm that allows for writing statistical models like ordinary programs, performing simulations by running those programs, and an…