Resource Interfaces

Chakrabarti, Arindam; Alfaro, Luca de; Henzinger, Thomas A.; Stoelinga, Mariëlle

doi:10.1007/978-3-540-45212-6_9

Cited by 164 publications

(188 citation statements)

References 5 publications

Supporting

Mentioning

187

Contrasting

Unclassified

Order By: Relevance

“…Such games have attracted considerable attention [3][4][5][6][7][8][9][10][11]16] in recent years, as they find natural applications in design and analysis of resource-constrained reactive systems, e.g. embedded or hybrid systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Energy Games in Multiweighted Automata

Fahrenberg

Juhl

Larsen

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

Abstract. Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g. only for behaviours where a resource is always available (nonnegative accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types of multiweighted automata and identify new complexity and (un)decidability results for both one-and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The idea of checking whether a given resource stays above zero at all times was first presented by Chakrabarti et al in [6], treating the subject in relation to interfaces. The lower and (weak) upper bound problems were first formulated in [4] for the case with a single weight.…”

Section: Introductionmentioning

confidence: 99%

Energy Games in Multiweighted Automata

Fahrenberg

Juhl

Larsen

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

show abstract

“…First, one can extend the formalism to cover the distinction between input, output and internal actions as it is usual in interface theories [11], and include even more time features, such as clocks in priced timed automata [4,9]. Second, one may extend the criteria for synthesis of the cheapest implementation by an additional requirement that the partial sums stay within given bounds as done in [10], or requiring the satisfaction of a temporal property as suggested in [11,12].…”

Section: Discussionmentioning

confidence: 99%

“…SkipCleanup 0 The most related work is [11] where prices are introduced into a class of interface theories and long-run average objectives are discussed. Our work omits the issue of distinguishing input and output actions.…”

Section: Bigcleanupmentioning

confidence: 99%

“…Our work omits the issue of distinguishing input and output actions. Nevertheless, compared to [11], this paper deals with the time durations, the one-shot hardware investment and, most importantly, refinement of specifications. Further, timed automata have also been extended with prices [4] and the long-run average reward has been computed in [9].…”

Section: Bigcleanupmentioning

confidence: 99%

See 1 more Smart Citation

Dual-Priced Modal Transition Systems with Time Durations

Beneš

Křetínský

Larsen

et al. 2012

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Modal transition systems are a well-established specification formalism for a highlevel 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.

show abstract