Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...
Abstract. We study games in the presence of an interaction structure, which allows players to communicate their preferences, assuming that each player initially only knows his own ...
Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zves...
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
Abstract— We present a strategy for resolving multiple hypotheses of a robot’s state during global localization. The strategy operates in two stages. In the first stage a uniq...
Rakesh Goyal, K. Madhava Krishna, Shivudu Bhuvanag...