Graph Rewriting Systems and Their Application to Network Reliability Analysis

Yasuyoshi OKADA; Masahiro HAYASHI

Graph Rewriting Systems and Their Application to Network Reliability Analysis

Yasuyoshi OKADA, Masahiro HAYASHI

Full Text Views

0

Cite this

Summary :

We propose a new type of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction method which plays an important role on analyze network reliability. By introducing this GRS, several facts were obtained as follows: (1) We clarified the reduction methods of network reliability analysis in the theoretical framework of GRS. (2) In the framework of GRS, we clarified the significance of the completeness in the reduction methods. (3) A procedure of recognizing complete systems from only given rewriting rules was shown. Specially the procedure (3) is given by introducing a boundary graph (B-Graph). Finally an application of GRS to network reliability analysis is shown.

Publication: IEICE TRANSACTIONS on Information Vol.E76-D No.2 pp.154-162

Publication Date: 1993/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Automaton, Language and Theory of Computing

Cite this

Copy

Yasuyoshi OKADA, Masahiro HAYASHI, "Graph Rewriting Systems and Their Application to Network Reliability Analysis" in IEICE TRANSACTIONS on Information, vol. E76-D, no. 2, pp. 154-162, February 1993, doi: .
Abstract: We propose a new type of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction method which plays an important role on analyze network reliability. By introducing this GRS, several facts were obtained as follows: (1) We clarified the reduction methods of network reliability analysis in the theoretical framework of GRS. (2) In the framework of GRS, we clarified the significance of the completeness in the reduction methods. (3) A procedure of recognizing complete systems from only given rewriting rules was shown. Specially the procedure (3) is given by introducing a boundary graph (B-Graph). Finally an application of GRS to network reliability analysis is shown.
URL: https://global.ieice.org/en_transactions/information/10.1587/e76-d_2_154/_p

Copy

@ARTICLE{e76-d_2_154,
author={Yasuyoshi OKADA, Masahiro HAYASHI, },
journal={IEICE TRANSACTIONS on Information},
title={Graph Rewriting Systems and Their Application to Network Reliability Analysis},
year={1993},
volume={E76-D},
number={2},
pages={154-162},
abstract={We propose a new type of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction method which plays an important role on analyze network reliability. By introducing this GRS, several facts were obtained as follows: (1) We clarified the reduction methods of network reliability analysis in the theoretical framework of GRS. (2) In the framework of GRS, we clarified the significance of the completeness in the reduction methods. (3) A procedure of recognizing complete systems from only given rewriting rules was shown. Specially the procedure (3) is given by introducing a boundary graph (B-Graph). Finally an application of GRS to network reliability analysis is shown.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Graph Rewriting Systems and Their Application to Network Reliability Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 154
EP - 162
AU - Yasuyoshi OKADA
AU - Masahiro HAYASHI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1993
AB - We propose a new type of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction method which plays an important role on analyze network reliability. By introducing this GRS, several facts were obtained as follows: (1) We clarified the reduction methods of network reliability analysis in the theoretical framework of GRS. (2) In the framework of GRS, we clarified the significance of the completeness in the reduction methods. (3) A procedure of recognizing complete systems from only given rewriting rules was shown. Specially the procedure (3) is given by introducing a boundary graph (B-Graph). Finally an application of GRS to network reliability analysis is shown.
ER -