{"title":"Capacity function-preserving star-delta transformations in flow networks","authors":"Ali M. Rushdi","doi":"10.1016/0143-8174(87)90020-5","DOIUrl":null,"url":null,"abstract":"<div><p>The concept of pseudo-switching (PS) functions has definite advantages in representing nonbinary discrete random functions, usually encountered in the study of flow networks. That concept is utilized in the development of star-delta and delta-star transformations that preserve the source-to-terminal (s−t) capacity function in a flow network. The usefulness of these transformations in reducing complex networks to equivalent series-parallel ones is illustrated by examples. The resulting series-parallel networks are easily solvable for the networks s−t capacity function, which is a compact expression of the probability mass function (p.m.f.) of the maximum s−t flow.</p></div>","PeriodicalId":101070,"journal":{"name":"Reliability Engineering","volume":"19 1","pages":"Pages 49-58"},"PeriodicalIF":0.0000,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0143-8174(87)90020-5","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reliability Engineering","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0143817487900205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The concept of pseudo-switching (PS) functions has definite advantages in representing nonbinary discrete random functions, usually encountered in the study of flow networks. That concept is utilized in the development of star-delta and delta-star transformations that preserve the source-to-terminal (s−t) capacity function in a flow network. The usefulness of these transformations in reducing complex networks to equivalent series-parallel ones is illustrated by examples. The resulting series-parallel networks are easily solvable for the networks s−t capacity function, which is a compact expression of the probability mass function (p.m.f.) of the maximum s−t flow.