Browse Prior Art Database

Structured Decision State Networks

IP.com Disclosure Number: IPCOM000084501D
Original Publication Date: 1975-Nov-01
Included in the Prior Art Database: 2005-Mar-02
Document File: 3 page(s) / 27K

Publishing Venue

IBM

Related People

Capper, BJ: AUTHOR [+2]

Abstract

A "decision state" network is a representation of an interactive computer application consisting of decision states which are nodes in the network and "processes" which are links. In a decision state, the "user" (in a user decision state) or the system (in a "program decision" state) decides which link to follow out of the node, i.e., which process to perform before reaching the next decision state.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 3

Structured Decision State Networks

A "decision state" network is a representation of an interactive computer application consisting of decision states which are nodes in the network and "processes" which are links. In a decision state, the "user" (in a user decision state) or the system (in a "program decision" state) decides which link to follow out of the node, i.e., which process to perform before reaching the next decision state.

It is a structured prograrming concept that the logic of a class of programs called "proper" may be expressed, using a limited group of logical constructs as building blocks.

A proper program is one that has one entry point, one exit point, and such that for any point of the program there exists a possible control path from entry to exit passing through the point.

A proper decision state network is defined in a precisely similar way, where a point may be either a node or on a link.

The objective of the concept is to provide a convenient means of building decision state networks, which assists in the development process and results in a more easily testable and maintainable network.

This is achieved by the concept shown in the figure. It may be shown that any proper decision state network may be made up of two and only two logical constructs A and B as building blocks. In the figure the boxes refer to processes, e.g., application functions, and the circular field DS to a decision state. The symbol DS is used both for user and program decision states...