Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
Crypto-currencies are digital assets designed to work as a medium of exchange, eg, Bitcoin,
but they are susceptible to attacks (dishonest behavior of participants). A framework for the …
but they are susceptible to attacks (dishonest behavior of participants). A framework for the …
Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata
The popular model checker PRISM has been successfully used for the modeling and
analysis of complex probabilistic systems. As one way to tackle the challenging state …
analysis of complex probabilistic systems. As one way to tackle the challenging state …
Probabilistic model checking for feature-oriented systems
Within product lines, collections of several related products are defined through their
commonalities in terms of features rather than specifying them individually one-by-one. In …
commonalities in terms of features rather than specifying them individually one-by-one. In …
Energy-utility quantiles
The concept of quantiles is well-known in statistics, but its benefits for the formal quantitative
analysis of probabilistic systems have been noticed only recently. To compute quantiles in …
analysis of probabilistic systems have been noticed only recently. To compute quantiles in …
A hardware/software stack for heterogeneous systems
Plenty of novel emerging technologies are being proposed and evaluated today, mostly at
the device and circuit levels. It is unclear what the impact of different new technologies at the …
the device and circuit levels. It is unclear what the impact of different new technologies at the …
Qualitative controller synthesis for consumption Markov decision processes
Abstract Consumption Markov Decision Processes (CMDPs) are probabilistic decision-
making models of resource-constrained systems. In a CMDP, the controller possesses a …
making models of resource-constrained systems. In a CMDP, the controller possesses a …
Trade-off analysis meets probabilistic model checking
Probabilistic model checking (PMC) is a well-established and powerful method for the
automated quantitative analysis of parallel distributed systems. Classical PMC-approaches …
automated quantitative analysis of parallel distributed systems. Classical PMC-approaches …
Maximizing the conditional expected reward for reaching the goal
The paper addresses the problem of computing maximal conditional expected accumulated
rewards until reaching a target state (briefly called maximal conditional expectations) in finite …
rewards until reaching a target state (briefly called maximal conditional expectations) in finite …
On Skolem-hardness and saturation points in Markov decision processes
The Skolem problem and the related Positivity problem for linear recurrence sequences are
outstanding number-theoretic problems whose decidability has been open for many …
outstanding number-theoretic problems whose decidability has been open for many …
Positivity-hardness results on Markov decision processes
This paper investigates a series of optimization problems for one-counter Markov decision
processes (MDPs) and integer-weighted MDPs with finite state space. Specifically, it …
processes (MDPs) and integer-weighted MDPs with finite state space. Specifically, it …