Translation of modified predicate transition nets models of cummunication protocols into simulation programs

  • Authors:
  • Chuang Lin;Dan Christian Marinescu

  • Affiliations:
  • Computer Sciences Department, Purdue University, West Lafayette, IN;Computer Sciences Department, Purdue University, West Lafayette, IN

  • Venue:
  • WSC '86 Proceedings of the 18th conference on Winter simulation
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

The use of modified predicate transition nets for the modeling of computer communication protocols has been investigated by the authors in reference [43]. The translation of such models into simulation programs is examined in this paper. Though protocols for all layers of a computer communication architecture can be modeled using the technique presented in this paper, we focus on the network layer protocols and we treat mechanisms like: fragmentation and reassembly, routing, store and forward buffering and congestion control.Non-prime transitions can be embedded into the modified predicate transition nets hence a top-down modeling is possible. The present paper uses a hierarchical modeling approach to describe complex communication mechanisms in terms of simpler constructs. Models developed using the modified predicate transition nets can be automatically translated into simulation programs. The paper presents the translation of a computer communication model into a program, using a process oriented simulation language, ASPOL.