Skip to main content
Conference Proceedings

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) (1992) 570 LNCS 36-47
DOI: 10.1007/3-540-55121-2_4
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Okada, Y., & Hayashi, M. (1992). Graph rewriting systems and their application to network reliability analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 570 LNCS, pp. 36–47). Springer Verlag. https://doi.org/10.1007/3-540-55121-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free