59 citations · 458 across the 94 of their papers we have counts for
6 papers · 1 filter
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…
Quantitative model-checking of controlled discrete-time Markov processes
Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen +1
This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide c…
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…
Zero-Reachability in Probabilistic Multi-Counter Automata
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera +2
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concen…
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…