From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

TDMA is probably the best choice for an energy efficient multiple access protocol for
wireless sensor networks. As such there exist many approaches of increased complexity …

Markov decision processes (MDPs) are standard models for probabilistic systems with non-
deterministic behaviours. Long-run average rewards provide a mathematically elegant …

Run-time Verification (RV) is an essential component of develo** cyber-physical systems,
where often the actual model of the system is infeasible to obtain or is not available. In the …

Certifying verification algorithms not only return whether a given property holds or not, but
also provide an accompanying independently checkable certificate and a corresponding …

We introduce feedback-control statistical system checking (FC-SSC), a new approach to
statistical model checking that exploits principles of feedback-control for the analysis of …

Markov decision processes (MDPs) are standard models for probabilistic systems with non-
deterministic behaviours. Mean payoff (or long-run average reward) provides a …

We consider the problem of verifying liveness for systems with a finite, but unbounded,
number of processes, commonly known as parameterised systems. Typical examples of …

Symbolic data structures using Binary Decision Diagrams (BDDs) have been successfully
used in the last decades to analyse large systems. While various BDD and MTBDD …

We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs)
with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses …