By Topic

Modelling a distributed dynamic channel allocation algorithm for mobile computing using predicate/transition nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
L. Ojala ; Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo, Finland ; N. Husberg ; S. Blom

Prakash et al. (1995) presented an algorithm for distributed dynamic channel allocation for mobile computing. A predicate/transition net model of the basic algorithm is presented. Inhibitor arcs are used to give a compact model. The same model can be used for any number of channels and cells with any configuration. This model illustrates how high level Petri nets can be used to model dynamic features. It is intended for formal verification of the algorithm using reachability analysis

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:3 )

Date of Conference: