Graph Rewriting Systems and their Application to Network Reliability Analysis

We propose a new kind of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction methods to analyze network reliability, and give the critical pair lemma in this paper.

[1]  N. M. Khan,et al.  A Direct Method to Calculate the Frequency and Duration of Failures for Large Networks , 1977, IEEE Transactions on Reliability.

[2]  A. Satyanarayana,et al.  Efficient algorithms for reliability analysis of planar networks - a survey , 1986, IEEE Transactions on Reliability.

[3]  Michel Billaud,et al.  Graph Rewriting Systems with Priorities , 1989, WG.

[4]  Themistocles Politof,et al.  Network Reliability and Inner-Four-Cycle-Free Graphs , 1986, Math. Oper. Res..

[5]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  Bruno Courcelle.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[7]  A. Rosenthal,et al.  Transformations for simplifying network reliability calculations , 1977, Networks.

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  Andrea Maggiolo-Schettini,et al.  Processes of Transforming Structures , 1982, J. Comput. Syst. Sci..

[10]  Ravi Sethi,et al.  Testing for the Church-Rosser Property , 1974, JACM.

[11]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[12]  Michael O. Ball,et al.  Complexity of network reliability computations , 1980, Networks.

[13]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[14]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[15]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

[16]  A. Satyanarayana,et al.  A linear-time algorithm to compute the reliability of planar cube-free networks , 1990 .