3229 search results - page 112 / 646 » The Theory of Timed Automata |
192
click to vote
IJFCS
2006
15 years 6 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
178
click to vote
TIME
2007
IEEE
16 years 21 days ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
191
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
This article deals with the recognition of recurring multivariate time series patterns modelled sample-point-wise by parametric fuzzy sets. An efficient classification-based approa...
198
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
188
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...