Browse Prior Art Database

Simulation Model Disassembly Software Significant Objects

IP.com Disclosure Number: IPCOM000099267D
Original Publication Date: 1990-Jan-01
Included in the Prior Art Database: 2005-Mar-14
Document File: 2 page(s) / 86K

Publishing Venue

IBM

Related People

Rowen, RB: AUTHOR

Abstract

Disclosed is an algorithm for transforming the of a discrete queueing network simulation model an enumerated set of objects that have significance for software requirements processing. The objects are of a file that contain fields suitable for by electronic design tools.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Simulation Model Disassembly Software Significant Objects

       Disclosed is an algorithm for transforming the of a
discrete queueing network simulation model an enumerated set of
objects that have significance for software requirements processing.
The objects are of a file that contain fields suitable for by
electronic design tools.

      The algorithm is applied to the statements of a high simulation
modeling language. The statement itself a number of attributes to the
record; these are first order objects. The relation of the statement
to statements (such as predecessor and successor) additional fields,
termed second order object. record fields are described in [1] in
Appendix D. A may generate more than one record.

      One key field is the generic type designation (GTYPE). generic
type is one of eight categories of manufacturing (1) (Transportation,
Measure, etc.). This can often be taken from the queueing model

      The steps are described using terminology for the Queueing
Package (RESQ) (2). The algorithm can be to other high level queueing
network languages.
   (1) Locate all SOURCE nodes. Trace the chain from
       SOURCE to the
       first CLASS node or an active or passive server.
        (a) Record each SOURCE as an ENTRY/EXIT GTYPE.
        (b) Any JV assignment becomes a TRANSFORMATION-ADD
            GTYPE.
        (c) Any GV or CV assignment becomes a TRANSACTION
            GTYPE.
        (d) Add implicit TRANSPORTATION steps between
            nodes.
   (2) Locate all SINK nodes. Trace the chain from SINK to
       the first active or passive server.
        (a) Record each SINK node as an ENTRY/EXIT GTYPE.
        (b) Treat all assignment nodes as TRANSACTION
            GTYPEs.
        (c) Add TRANSPORTATION steps as before.
   (3) Identify all CLASS nodes.
        (a) Record each active CLASS node as explicit
            TRANSPORTATION.
        (b) Treatment of passive CLASS nodes is dependent
            on physical interpretation of node type.
        (c) Add an implied TRANSPORTATION step between a
            CLASS node
       ...