In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is pai...
The extension of the Leitmann-Schmitendorf advertising game to n players and positive time discounting is investigated. We show that the strong time consistency of the open-loop N...