423 search results - page 27 / 85 » Bounded Finite State Controllers |
107
click to vote
MEMOCODE
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
107
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
AUTOMATICA
2008
14 years 12 months ago
2008
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
CDC
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...