Abstract Model checking is a formal verification technique. It takes an exhaustively strategy
to check hardware circuits and network protocols against desired properties. Having been …

We study turn-based stochastic zero-sum games with lexicographic preferences over
objectives. Stochastic games are standard models in control, verification, and synthesis of …

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 …

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 …

We study turn-based stochastic zero-sum games with lexicographic preferences over
reachability and safety objectives. Stochastic games are standard models in control …

Probabilistic model checking (PMC) is a well-established method for the quantitative
analysis of dynamic systems. Description logics (DLs) provide a well-suited formalism to …

Simple stochastic games are turn-based 2½-player games with a reachability objective. The
basic question asks whether one player can ensure reaching a given target with at least a …

Modern system design often requires comparing several models over a large design space.
Different models arise out of a need to weigh different design choices, to check core …

This paper presents an efficient procedure for multi-objective model checking of long-run
average reward (aka: mean pay-off) and total reward objectives as well as their combination …

We present the conditional value-at-risk (CVaR) in the context of Markov chains and Markov
decision processes with reachability and mean-payoff objectives. CVaR quantifies risk by …