1650 search results - page 171 / 330 » The HOM problem is decidable |
148
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
123
click to vote
GD
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
139
click to vote
HYBRID
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. An algorithm for computing the maximal controlled invariant set and the least restrictive controller for discrete time systems is proposed. We show how the algorithm can ...
120
click to vote
TAPSOFT
1991
Springer
15 years 8 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
144
click to vote
DGCI
2009
Springer
15 years 7 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...