On analysis of characteristics of flowgraphs and state transition diagrams by numbers of paths

Bibliographic Information

Other Title
  • フローグラフや状態遷移図の特牲のパス数による分析

Search this article

Description

Concerning the flowgraphs and state transition diagrams. a sequence of consecutive links is called path length L, the number of paths of length L is described as P_L, their sequence is called path vector {P_L}, and P_<L+1> / P_L is defined as increasing rate of P_L. From the {P_L}, we can obtain the following reslts; Flowgraphs and state transition diagrams are classified into 3 classes depending on the characteristics of loops they contain. When L increases, (1) if no loops are contained then P_L becomes 0, (2) if loops have no common nodes then P_L increases at a rate proportional to a power of L, and (3) if loops have common nodes then P_L increases at a rate proportional to a exponential function of L.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 98 (8), 61-66, 1998-01-29

    Information Processing Society of Japan (IPSJ)

Details 詳細情報について

  • CRID
    1570572701999542912
  • NII Article ID
    110004062346
  • NII Book ID
    AN10463997
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top