We consider the problems of efficiently diagnosing (and predicting) what did will) happen after a given sequence observations execution partially observable one-clock timed automaton. This is made difficult by facts that automata are infinite-state systems, and they can in general not be determinized. introduce markings as formalism to keep track evolution set reachable configurations over time...

In this paper we propose a model, timed automata with non-instantaneous actions, which allows representing in a suitable way real-time systems. Timed automata with non-instantaneous actions extend the timed automata model by dropping the assumption that actions are instantaneous: in our model an action can take some time to be completed. We investigate the expressiveness of the new model, compa...

We introduce a new formalism called automata over a timed domain which provides an adequate framework for the determinization of timed systems. In this formalism, determinization w.r.t. timed language is always possible at the cost of changing the timed domain. We give a condition for determinizability of automata over a timed domain without changing the timed domain, which allows us to recover...