Safe schedulability of bounded-rate multi-mode systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00072857" target="_blank" >RIV/00216224:14330/13:00072857 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2461328.2461366" target="_blank" >http://dx.doi.org/10.1145/2461328.2461366</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2461328.2461366" target="_blank" >10.1145/2461328.2461366</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Safe schedulability of bounded-rate multi-mode systems

Popis výsledku v původním jazyce

Bounded-rate multi-mode systems (BMS) are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. The schedulability problem for BMS is defined as an infinite-round game between two players? the scheduler and the environment?where in each round the scheduler proposes a time and a mode while the environment chooses an allowable rate for that mode, and the state of the system changes linearly in the direction of the rate vector. The goal of the scheduler is to keep the state of the system within a pre-specified safe set using a non-Zeno schedule, while the goal of the environment is the opposite. Greenscheduling under uncertainty is a paradigmatic example of BMS where a winning strategy of the scheduler corresponds to a robust energy-optimal policy.

Název v anglickém jazyce

Safe schedulability of bounded-rate multi-mode systems

Popis výsledku anglicky

Bounded-rate multi-mode systems (BMS) are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. The schedulability problem for BMS is defined as an infinite-round game between two players? the scheduler and the environment?where in each round the scheduler proposes a time and a mode while the environment chooses an allowable rate for that mode, and the state of the system changes linearly in the direction of the rate vector. The goal of the scheduler is to keep the state of the system within a pre-specified safe set using a non-Zeno schedule, while the goal of the environment is the opposite. Greenscheduling under uncertainty is a paradigmatic example of BMS where a winning strategy of the scheduler corresponds to a robust energy-optimal policy.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/LG13010" target="_blank" >LG13010: Zastoupení ČR v European Research Consortium for Informatics and Mathematics</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 16th international conference on Hybrid systems: computation and control, HSCC 2013

ISBN

9781450315678

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

243-252

Název nakladatele

ACM

Místo vydání

New York, NY, USA

Místo konání akce

Philadelphia, Pennsylvania, USA

Datum konání akce

1. 1. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—