Graphical versus logical specifications
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
The complexity of mean payoff games on graphs
Theoretical Computer Science
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Quantitative refinement for weighted modal transition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
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.