Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a ...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
One of the unknowns of emailing is the time it will take the receiver to form and post a reply. Response times vary considerably, and the chronemics of email are an important non-...
— In order for humanoid robots to perform skillful tasks, a reliable and scalable computing system that supports hard real-time processing is required. This paper describes a fiv...