{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:21Z","timestamp":1725663621865},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:48:07Z","timestamp":1330231687000},"page":"36-47","source":"Crossref","is-referenced-by-count":0,"title":["Graph rewriting systems and their application to network reliability analysis"],"prefix":"10.1007","author":[{"given":"Yasuyoshi","family":"Okada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Hayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"4_CR1","unstructured":"Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D.: \u201cAn Algebraic Theory of Graph Reduction,\u201d Research Report n\u00b0 91\u201336, Bordeaux-I University, 1991."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.3230100206","volume":"10","author":"M. O. Ball","year":"1980","unstructured":"Ball, M. O.: \u201cComplexity of Network Reliability Computations,\u201d Networks, Vol. 10, pp. 153\u2013165, 1980.","journal-title":"Networks"},{"key":"4_CR3","unstructured":"Barendreght, H.P.: \u201cThe Lambda Calculus-Its Syntax and Semantics,\u201d Revised Edition, North Holland, 1984."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"Y. Bauderon","year":"1987","unstructured":"Bauderon, Y. and Courcelle, B.: \u201cGraph Expression and Graph Rewritings,\u201d Mathematical Systems Theory, 20, pp. 83\u2013127, 1987.","journal-title":"Mathematical Systems Theory"},{"key":"4_CR5","unstructured":"Brandenburg, F.J.: \u201cOn context-free graph grammars with bounded degrees\u201d Proceedings of Toyohashi Symposium on Theoretical Computer Science, pp. 23\u201326 August, 1990."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B.: \u201cAn axiomatic definition of context-free rewriting systems and its application to NLC graph grammars.\u201d Theoretical Computer Science, 55, pp. 141\u2013181, 1987.","journal-title":"Theoretical Computer Science"},{"key":"4_CR7","unstructured":"Courcelle, B.: \u201cThe monadic second order logic of graphs VI: On several presentations of graphs by relational structures.\u201d Research Report n\u00b0 89\u201399, Bordeaux-I University, 1989."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., and Schnider, H.: \u201cGraph Grammars: An algebraic approach,\u201d Proceeding 14th IEEE Symposium Switching and Automata Theory, Iowa City, pp. 167\u2013180, 1973.","DOI":"10.1109\/SWAT.1973.11"},{"key":"4_CR9","first-page":"1","volume-title":"Lecture Notes Computer Science, Vol. 73","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: \u201cIntroduction to the algebraic theory of graphs grammars (A Survry),\u201d in Proceeding of 1st International Workshop on Graph Grammars, Lecture Notes Computer Science, Vol. 73, Springer Verlag, Berlin, pp. 1\u201369, 1979."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"Ehrig, H., Kreowski, H.J., Maggiolo-Shettini, A., Rosen, B. R., and Winkowski, J.: \u201cTransformations of structures: an algebraic approach,\u201d Mathematical Systems Theory, Vol 14, pp. 305\u2013334, 1981.","journal-title":"Mathematical Systems Theory"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: \u201cGraph Theory,\u201d Addison-Wesley, Reading, MA 1969."},{"key":"4_CR12","first-page":"37","volume":"90-53","author":"M. Hayashi","year":"1990","unstructured":"Hayashi, M. and Okada, Y.: \u201cThe Equality of Graphs by Reduction Method and Application,\u201d IEICE Japan Tech. Rep. CAS and VLD 90-53, pp. 37\u201344, 1990.","journal-title":"IEICE Japan Tech. Rep. CAS and VLD"},{"key":"4_CR13","unstructured":"Hindley, J. and Seldin, J: \u201cIntroduction to Combinators and Lambda Calculus,\u201d London Mathematical Society Student Texts 1, Cambridge University, 1986."},{"issue":"No.4","key":"4_CR14","first-page":"11","volume":"27","author":"G.P. Huet","year":"1980","unstructured":"Huet, G.P.: \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,\u201d Journal of the Association for Computing Machinery, Vol. 27, No. 4, pp. 11\u201321, 1980.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"4_CR15","volume-title":"Computational pr\u014cblems in abstract algebras","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E. and Bendix, P.B.: \u201cSimple Word Problems in Universal Algebras,\u201d Computational pr\u014cblems in abstract algebras, Pergamon Press, Oxford 1970."},{"key":"4_CR16","volume-title":"Research Notes in Theoretical Computer Science","author":"P. Chenadec Le","year":"1986","unstructured":"Le Chenadec, P.: \u201cCanonical Forms in Finitely Presented Algebra,\u201d Research Notes in Theoretical Computer Science, Pitman London, 1986."},{"key":"4_CR17","unstructured":"Litovsky, I. and Metivier, Y.: \u201cComputing Trees with Graph Rewriting Systems with Priorities,\u201d Research Report n\u00b0 90-87, Bordeaux-I University, 1990."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0022-0000(82)90029-0","volume":"24","author":"A. Maggiolo-Schettini","year":"1982","unstructured":"Maggiolo-Schettini, A. and Winkowski, J.: \u201cProcess of Transforming Structures\u201d Journal of Computer and System Sciences 24, pp. 245\u2013282, 1982.","journal-title":"Journal of Computer and System Sciences"},{"issue":"No.5","key":"4_CR19","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TR.1977.5220184","volume":"R-26","author":"N.M. Khan","year":"1977","unstructured":"Khan, N.M., Rajamani, K. and Banerjee, S.K.: \u201cA direct method to Calculate the Frequency and Duration of Failures for Large Networks,\u201d IEEE Transactions on Reliability Analysis, Vol. R-26, No. 5, December pp.318\u2013321, 1977.","journal-title":"IEEE Transactions on Reliability Analysis"},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-52292-1_7","volume":"411","author":"M. Billaud","year":"1989","unstructured":"Billaud, M., Lafon, P., Metivier, E. and Sopena, E.: \u201cGraph Rewriting Systems with Priorities,\u201d 15th International Workshop WG, Lecture Note in Computer Science 411, pp. 94\u2013106, 1989.","journal-title":"15th International Workshop WG, Lecture Note in Computer Science"},{"issue":"No.2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: \u201cOn theories with a combinatorial definition of \u2018equivalence',\u201d Ann. Math., Vol. 43, No. 2, pp. 223\u2013243, 1942.","journal-title":"Ann. Math."},{"key":"4_CR22","first-page":"57","volume":"90-7","author":"Y. Okada","year":"1990","unstructured":"Okada, Y. and M, Hayashi.: \u201cGraph Rewriting Systems and Application to Network Reliability Analysis.\u201d IEICE Japan Tech. Rep. Comp 90-7, pp. 57\u201366, 1990.","journal-title":"IEICE Japan Tech. Rep. Comp"},{"key":"4_CR23","unstructured":"Politof, T.: \u201d\u03b4-Y reducible graphs,\u201d Working Paper 88-12-52, Department of Decision Science and Management Information Systems,\u201d Concordia University (May 1989)."},{"issue":"No.3","key":"4_CR24","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1109\/TR.1986.4335427","volume":"R-35","author":"T. Politof","year":"1986","unstructured":"Politof, T. and Satyanarayana, A.: \u201cEfficient Algorithms for Reliability Analysis of Planar Networks \u2014 A survey,\u201d IEEE Transactions Reliability, Vol. R-35, No. 3, pp. 252\u2013259, August, 1986.","journal-title":"IEEE Transactions Reliability"},{"issue":"No.3","key":"4_CR25","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1287\/moor.11.3.484","volume":"11","author":"T. Politof","year":"1986","unstructured":"Politof, T. and Satyanarayana, A.: \u201cNetwork Reliability and Inner-Four-Cycle-Free Graph,\u201d Mathematics of Operation Research, Vol. 11, No. 3, pp. 484\u2013505, August, 1986.","journal-title":"Mathematics of Operation Research"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/24.61311","volume":"R-39","author":"T. Politof","year":"1990","unstructured":"Politof, T. and Satyanarayana, A.: \u201dA linear time Algorithm to Compute the Reliability of Planar Cube-Free Networks,\u201d IEEE Transactions on Reliability, Vol. R-39, pp. 557\u2013563, Dec, 1990.","journal-title":"IEEE Transactions on Reliability"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Rosenthal, A.: \u201cComputing The Reliability of Complex Networks SIAMJ. APPL. MATH. Vol. 32, No. 2, March, 1977.","DOI":"10.1137\/0132031"},{"key":"4_CR28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230070202","volume":"7","author":"A. Rosenthal","year":"1977","unstructured":"Rosenthal, A. and Frisque, D.: \u201cTransformations for Simplifying Network Reliability Calculations\u201d Networks, Vol. 7, pp. 97\u2013111, 1977.","journal-title":"Networks"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/net.3230130107","volume":"13","author":"A. Satyanarayana","year":"1983","unstructured":"Satyanarayana, A. and Chan, M.: \u201cNetwork Reliability and the Factoring Theorem,\u201d Networks, Vol. 13, pp. 107\u2013120, 1983.","journal-title":"Networks"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Satyanarayana, A. and Wood, R. K.: \u201cA Linear-Time Algorithm for computing K-terminal reliability of normal graphs in series-parallel networks,\u201d SIAM J. Computing, Vol. 14, November, 1985.","DOI":"10.1137\/0214057"},{"issue":"No.4","key":"4_CR31","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/321850.321862","volume":"21","author":"R. Sethi","year":"1974","unstructured":"Sethi, R.: \u201cTesting for the Church-Rosser theorems,\u201d J.ACM, Vol. 21, No. 4, pp. 671\u2013679, October, 1974.","journal-title":"J.ACM"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:41Z","timestamp":1605628661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}