#### Filter Results:

#### Publication Year

2001

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—In this paper, we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound, but it is less pessimistic, thus… (More)

—In resource-constrained systems, the interference generated by the concurrent execution of multiple controller tasks leads to extra delay and jitter, which degrade control performance and may even jeopardize the stability of the controlled system. This work presents a general methodology that integrates control issues and real-time schedulability analysis… (More)

In this paper we propose a novel schedulability analysis for verihing the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound but it is less pessimistic, so allowing… (More)

—In digital control systems the state is sampled at given sampling instants and the input is kept constant between two consecutive instants. By optimal sampling problem we mean the selection of sampling instants and control inputs, such that a given function of the state and input is minimized. In this paper we formulate the optimal sampling problem and we… (More)

- ‹
- 1
- ›