Graph rewriting systems and their application to network reliability analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 570 LNCS, Issue , 1992, Pages 36-47

  Okada, Yasuyoshi ^a   Hayashi, Masahiro ^a  

^a Kashino Diverse Brain Research Laboratory of NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

GRAPH REWRITING SYSTEMS; NETWORK RELIABILITY; NETWORK RELIABILITY ANALYSIS; REDUCTION METHOD; THEORETICAL FOUNDATIONS;

RELIABILITY ANALYSIS;

EID: 37149029524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55121-2_4     Document Type: Conference Paper

References (31)

1. Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D.: “An Algebraic Theory of Graph Reduction,” Research Report n° 91-36, Bordeaux-I University, 1991.
2. Ball, M. O.: “Complexity of Network Reliability Computations,” Networks, Vol. 10, pp. 153-165, 1980.
3. Barendreght, H.P.: “The Lambda Calculus-Its Syntax and Semantics,” Revised Edition, North Holland, 1984.
4. Bauderon, Y. and Courcelle, B.: “Graph Expression and Graph Rewritings,” Mathematical Systems Theory, 20, pp. 83-127, 1987.
5. Brandenburg, F.J.: “On context-free graph grammars with bounded degrees” Proceedings of Toyohashi Symposium on Theoretical Computer Science, pp. 23-26 August, 1990.
6. Courcelle, B.: “An axiomatic definition of context-free rewriting systems and its application to NLC graph grammars.” Theoretical Computer Science, 55, pp. 141-181, 1987.
7. Courcelle, B.: “The monadic second order logic of graphs VI: On several presentations of graphs by relational structures.” Research Report n° 89-99, Bordeaux-I University, 1989.
8. Ehrig, H., Pfender, M., and Schnider, H.: “Graph Grammars: An algebraic approach,” Proceeding 14th IEEE Symposium Switching and Automata Theory, Iowa City, pp. 167-180, 1973.
9. Ehrig, H.: “Introduction to the algebraic theory of graphs grammars (A Survry),” in Proceeding of 1st International Workshop on Graph Grammars, Lecture Notes Computer Science, Vol. 73, Springer Verlag, Berlin, pp. 1-69, 1979.
10. Ehrig, H., Kreowski, H.J., Maggiolo-Shettini, A., Rosen, B. R., and Winkowski, J.: “Transformations of structures: an algebraic approach,” Mathematical Systems Theory, Vol 14, pp. 305-334, 1981.
11. Harary, F.: “Graph Theory,” Addison-Wesley, Reading, MA 1969.
12. Hayashi, M. and Okada, Y.: “The Equality of Graphs by Reduction Method and Application,” IEICE Japan Tech. Rep. CAS and VLD 90-53, pp. 37-44, 1990.
13. Hindley, J. and Seldin, J: “Introduction to Combinators and Lambda Calculus,” London Mathematical Society Student Texts 1, Cambridge University, 1986.
14. Huet, G.P.: “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” Journal of the Association for Computing Machinery, Vol. 27, No. 4, pp. 11-21, 1980.
15. Knuth, D.E. and Bendix, P.B.: “Simple Word Problems in Universal Algebras,” Computational prŌblems in abstract algebras, Pergamon Press, Oxford 1970.
16. Le Chenadec, P.: “Canonical Forms in Finitely Presented Algebra,” Research Notes in Theoretical Computer Science, Pitman London, 1986.
17. Litovsky, I. and Metivier, Y.: “Computing Trees with Graph Rewriting Systems with Priorities,” Research Report n° 90-87, Bordeaux-I University, 1990.
18. Maggiolo-Schettini, A. and Winkowski, J.: “Process of Transforming Structures” Journal of Computer and System Sciences 24, pp. 245-282, 1982.
19. Khan, N.M., Rajamani, K. and Banerjee, S.K.: “A direct method to Calculate the Frequency and Duration of Failures for Large Networks,” IEEE Transactions on Reliability Analysis, Vol. R-26, No. 5, December pp.318-321, 1977.
20. Billaud, M., Lafon, P., Metivier, E. and Sopena, E.: “Graph Rewriting Systems with Priorities,” 15th International Workshop WG, Lecture Note in Computer Science 411, pp. 94-106, 1989.
21. Newman, M.H.A.: “On theories with a combinatorial definition of ‘equivalence’,” Ann. Math., Vol. 43, No. 2, pp. 223-243, 1942.
22. Okada, Y. and M, Hayashi.: “Graph Rewriting Systems and Application to Network Reliability Analysis.” IEICE Japan Tech. Rep. Comp 90-7, pp. 57-66, 1990.
23. Politof, T.: "δ-Y reducible graphs,” Working Paper 88-12-52, Department of Decision Science and Management Information Systems,” Concordia University (May 1989).
24. Politof, T. and Satyanarayana, A.: “Efficient Algorithms for Reliability Analysis of Planar Networks - A survey,” IEEE Transactions Reliability, Vol. R-35, No. 3, pp. 252-259, August, 1986.
25. Politof, T. and Satyanarayana, A.: “Network Reliability and Inner-Four-Cycle-Free Graph,” Mathematics of Operation Research, Vol. 11, No. 3, pp. 484-505, August, 1986.
26. Politof, T. and Satyanarayana, A.: “A linear time Algorithm to Compute the Reliability of Planar Cube-Free Networks,” IEEE Transactions on Reliability, Vol. R-39, pp. 557-563, Dec, 1990.
27. Rosenthal, A.: “Computing The Reliability of Complex Networks SIAMJ. APPL. MATH. Vol. 32, No. 2, March, 1977.
28. Rosenthal, A. and Frisque, D.: “Transformations for Simplifying Network Reliability Calculations” Networks, Vol. 7, pp. 97-111, 1977.
29. Satyanarayana, A. and Chan, M.: “Network Reliability and the Factoring Theorem,” Networks, Vol. 13, pp. 107-120, 1983.
30. Satyanarayana, A. and Wood, R. K.: “A Linear-Time Algorithm for computing K-terminal reliability of normal graphs in series-parallel networks,” SIAM J. Computing, Vol. 14, November, 1985.
31. Sethi, R.: “Testing for the Church-Rosser theorems,” J.ACM, Vol. 21, No. 4, pp. 671-679, October, 1974.