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...

A continuous monitoring of the physical strength and mobility elderly people is important for maintaining their health treating diseases at an early stage. However, frequent screenings by physicians are exceeding logistic capacities. An alternate approach automatic unobtrusive collection functional measures ambient sensors. In current publication, we show correlation among data motion sensors w...

background: subjective assessment of primary achalasia is not accurate. we aimed to evaluate surface of barium retention in the objective assessment of these patients. materials and methods: subjective and objective esophageal functions of 99 patients with primary achalasia were evaluated initially and 43 of them were reevaluated one month after balloon dilation. results: predilation: â  9cases...

Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting probabilistic behaviour and their expressiveness has been studied relative to non-probabilistic transition systems and Markov chains. In this paper, we consider ...

We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable....