Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Model checking
Stochastic learning solution for distributed discrete power control game in wireless data networks
IEEE/ACM Transactions on Networking (TON)
Power allocation games for MIMO multiple access channels with coordination
IEEE Transactions on Wireless Communications
Introducing hierarchy in energy games
IEEE Transactions on Wireless Communications
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
The Water-Filling Game in Fading Multiple-Access Channels
IEEE Transactions on Information Theory
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
A game-theoretic approach to energy-efficient power control in multicarrier CDMA systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control (PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors wanted to know whether this approach can be applied to distributed PC. It turns out that it can be applied successfully and allows one to analyze realistic scenarios including the case of discrete transmit powers and games with incomplete information. The proposed methodology is as follows. We state some objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired properties are verified and determine a winning strategy.