513 search results - page 41 / 103 » Finitely Based, Finite Sets of Words |
FUIN
2008
14 years 12 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
SIAMJO
2008
14 years 11 months ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
104
click to vote
SIAMIS
2008
14 years 11 months ago
2008
Motion of curves governed by geometric evolution laws, such as mean curvature flow and surface diffusion, is the basis for many algorithms in image processing. If the images to be ...
HYBRID
2000
Springer
15 years 3 months ago
2000
Springer
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
RTCSA
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we propose a protocol synthesis method based on a partial order model (called event structures) for the class of context-free processes. First, we assign a unique n...