59 citations · 458 across the 94 of their papers we have counts for
4 papers · 2 filters
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure ter…
Analysis of Timed and Long-Run Objectives for Markov Automata
Dennis Guck, Hassan Hatefi, Holger Hermanns +2
Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over…
Parametric LTL on Markov Chains
Souymodip Chakraborty, Joost-Pieter Kataon
This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains v…
Probably Safe or Live
Joost-Pieter Katoen, Lei Song, Lijun Zhang
This paper presents a formal characterisation of safety and liveness properties à la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is estab…