Sciweavers

5981 search results - page 63 / 1197
» time 2006
Sort
View
FORMATS
2006
Springer
14 years 1 months ago
Undecidable Problems About Timed Automata
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 ...
Olivier Finkel
FUIN
2007
104views more  FUIN 2007»
13 years 10 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
JUCS
2010
114views more  JUCS 2010»
13 years 8 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
NN
2006
Springer
105views Neural Networks» more  NN 2006»
13 years 10 months ago
Unfolding preprocessing for meaningful time series clustering
Clustering methods are commonly applied to time series, either as a preprocessing stage for other methods or in their own right. In this paper it is explained why time series clus...
Geoffroy Simon, John Aldo Lee, Michel Verleysen
ORL
2002
78views more  ORL 2002»
13 years 9 months ago
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...
Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae