Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Path Abstraction for Markov Reward Models
Arnd Hartmanns, Robert Modderman
Path abstraction originated as a technique for counterexample refinement in probabilistic model checking. Given a discrete-time Markov chain, it summarises the probabilities passin…
cs.FL2025
DTMC Model Checking by Path Abstraction Revisited (extended version)
Arnd Hartmanns, Robert Modderman
Computing the probability of reaching a set of goal states G in a discrete-time Markov chain (DTMC) is a core task of probabilistic model checking. We can do so by directly computi…