232 search results - page 24 / 47 » Termination of linear bounded term rewriting systems |
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
AUTOMATICA
2006
13 years 7 months ago
2006
This paper considers the robustness of stochastic stability of Markovian jump linear systems in continuous- and discrete-time with respect to their transition rates and probabilit...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
AUTOMATICA
2005
13 years 7 months ago
2005
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...