We consider two-player, turn-based weighted timed games played on timed automata
equipped with (positive and negative) integer weights, in which one player seeks to reach a …

Probabilistic automata are an extension of nondeterministic finite automata in which
transitions are annotated with probabilities. Despite its simplicity, this model is very …

A labelled Markov decision process (MDP) is a labelled Markov chain with nondeterminism;
ie, together with a strategy a labelled MDP induces a labelled Markov chain. The model is …

Given two weighted automata, we consider the problem of whether one is big-O of the other,
ie, if the weight of every finite word in the first is not greater than some constant multiple of …

The present work consists of two separate investigations into the quantitative measurement
of the complexity of performing some computational task. In the first chapter, the task is …

We study alternating automata with qualitative semantics over infinite binary trees:
Alternation means that two opposing players construct a decoration of the input tree called a …

The emptiness and containment problems for probabilistic automata are natural quantitative
generalisations of the classical language emptiness and inclusion problems for Boolean …

We explore language semantics for automata combining probabilistic and nondeterministic
behaviors. We first show that there are precisely two natural semantics for probabilistic …

The emptiness and containment problems for probabilistic automata are natural quantitative
generalisations of the classical language emptiness and inclusion problems for Boolean …

Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks
whether for all strategies of the first MDP there exists a strategy of the second MDP such that …