Communicating sequential processes
Communicating sequential processes
A calculus of refinements for program derivations
Acta Informatica
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Programming in OCCAM
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Performance analysis of probabilistic action systems
Formal Aspects of Computing
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Using probabilistic model checking for dynamic power management
Formal Aspects of Computing
Probabilistic guarded commands mechanized in HOL
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Policy optimization for dynamic power management
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
An important concern in wireless network technology is battery conservation. A promising approach to saving energy is to allow nodes periodically to enter a “low power mode”, however this strategy contributes to message delay, and careful management is required so that the system-wide performance is not severely compromised. In this paper we show how to manage power schedules using the quantitative modal μ-calculus which allows the specification of a quantitative performance property as a game in which a maximising player’s optimal strategy corresponds to optimising overall performance relative to the specified property. We extend the standard results on discounted games to a class of infinite state systems, and illustrate our results on a small case study.