Theoretical Computer Science
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
On using priced timed automata to achieve optimal scheduling
Formal Methods in System Design
Query-Based Model Checking of Ad Hoc Network Protocols
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Cost Analysis for Embedded Systems: Experiments with Priced Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Ad Hoc Network Routing Protocols: ARAN vs. endairA
SEFM '10 Proceedings of the 2010 8th IEEE International Conference on Software Engineering and Formal Methods
A formal analysis of the web services atomic transaction protocol with UPPAAL
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Optimal spectrum sensing framework for cognitive radio networks
IEEE Transactions on Wireless Communications
A survey on spectrum management in cognitive radio networks
IEEE Communications Magazine
Opportunistic Spectrum Sharing Schemes for CDMA-Based Uplink MAC in Cognitive Radio Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In Cognitive Radio (CR) networks, the vacant primary user channels should be utilized in an opportunistic manner, without causing any interference to the primary users. This opportunistic channel utilization needs to be effectively optimized for a competent CR network design. With this motivation, in this paper, we approach the channel utilization problem of CR networks from a software based model checking perspective rather than an ordinary analytical decomposition. Specifically, we model and simulate the CR communication system by the aid of the Priced Timed Automata(PTA) based Model Checking paradigm using UPPAAL. We apply this specific model checking enhanced with cost assignments to infer about the optimum utilization of primary user channels in CR networks. This way, given some specific properties of primary users and cognitive users, we are able to simulate and obtain the maximum utilization possible. Instead of running simulations simultaneously and exploring a subset of possible system runs, our proposed model checking has provided us the optimal system run amongst all the possible system runs.