Name
Abstract | ||
|---|---|---|
Modal transition systems are a well-established specification formalism for a high-level modelling of component-based software systems. We present a novel extension of the formalism called modal transition systems with durations where time durations are modelled as controllable or uncontrollable intervals. We further equip the model with two kinds of quantitative aspects: each action has its own running cost per time unit, and actions may require several hardware components of different costs. We ask the question, given a fixed budget for the hardware components, what is the implementation with the cheapest long-run average reward. We give an algorithm for computing such optimal implementations via a reduction to a new extension of mean payoff games with time durations and analyse the complexity of the algorithm. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28717-6_12 | LPAR |
Keywords | Field | DocType |
hardware component,time unit,modal transition system,different cost,new extension,component-based software system,well-established specification formalism,cheapest long-run average reward,novel extension,dual-priced modal transition system,time duration | Ask price,Computer science,Investment cost,Real-time computing,Software system,Implementation,Theoretical computer science,Formalism (philosophy),Unit of time,Computer engineering,Modal,Stochastic game | Conference |
Volume | ISSN | Citations |
7180 | 0302-9743 | 8 |
PageRank | References | Authors |
0.47 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikola Beneš | 1 | 94 | 12.24 |
| Jan Křetínský | 2 | 190 | 12.05 |
| Kim Guldstrand Larsen | 3 | 4434 | 346.88 |
| Mikael H. Møller | 4 | 68 | 4.78 |
| Jiří Srba | 5 | 629 | 31.24 |