Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Autonomic Computing is now showing its value as a solution to the increased complexities of maintaining computer systems and has been applied to many different fields. In this pap...
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
We study the problem of improving the user perceived quality of online games in which multiple players form a game session and exchange game-state updates over an overlay network....
Tone mapping and visual adaptation are crucial for the generation of static, photorealistic images. A largely unexplored problem is the simulation of adaptation and its changes ove...