734 search results - page 11 / 147 » Undecidability over Continuous Time |
LATA
2010
Springer
14 years 6 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Monitoring global states of an application deployed over distributed nodes becomes prevalent in today's datacenters. State monitoring requires not only correct monitoring resu...
IWBRS
2005
Springer
14 years 2 months ago
2005
Springer
Interest in automated biometrics continues to increase, but has little consideration of time. This paper deals with a problem of recognition by gait when time-dependent and time-in...
IANDC
2007
13 years 8 months ago
2007
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
CONCUR
2009
Springer
14 years 15 days ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...