Skip to main content
Log in

Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods

  • Special section on the practical use of high-level Petri nets
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract.

A distributed dynamic channel allocation algorithm has been proposed in [11]. In this paper the algorithm is modelled using predicate/transition nets. The same model can be used for any number of cell and channel configurations. The Maria reachability analyser has been used to analyse the protocol for some configurations. These are deadlock-free and are shown to satisfy the requirement that the same channel is never allocated to two neighbouring cells. The suitability of high-level nets for the modelling and analysis of distributed algorithms is discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Published online: 24 August 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ojala, L., Husberg, N. & Tynjälä, T. Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods. STTT 3, 382–393 (2001). https://doi.org/10.1007/s100090100057

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s100090100057

Navigation