{"title":"Reduced base model construction methods for stochastic activity networks","authors":"W. Sanders, J. F. Meyer","doi":"10.1109/PNPM.1989.68541","DOIUrl":null,"url":null,"abstract":"Several model classes for system evaluation exist and are capable of representing the kind of complex behavior exhibited by contemporary distributed computer architectures and computer-communication networks. However, a number of problems associated with the evaluation of large-scale systems arise because of the size and complexity of the stochastic process derived from the underlying net model, which serves as a 'base model' for subsequent solution of the measures in question. If this base model is constructed by standard means, e.g. it is identified with the marking behavior of the net, traditional methods of solution quickly become intractable for large systems, limiting their application to systems of only moderate complexity. This problem is addressed in the stochastic activity networks (SANs) by developing base model construction methods that account for symmetries in SAN structure and are tailored to the variable in question (e.g. response time, time to failure, etc.). It is found that such a technique can yield dramatic reductions in state-space size while preserving stochastic properties required for practical means of solution. This technique permits direct construction of a reduced base model, thus avoiding size limitations associated with more traditional approaches to model amplification.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"207 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"255","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1989.68541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 255
Abstract
Several model classes for system evaluation exist and are capable of representing the kind of complex behavior exhibited by contemporary distributed computer architectures and computer-communication networks. However, a number of problems associated with the evaluation of large-scale systems arise because of the size and complexity of the stochastic process derived from the underlying net model, which serves as a 'base model' for subsequent solution of the measures in question. If this base model is constructed by standard means, e.g. it is identified with the marking behavior of the net, traditional methods of solution quickly become intractable for large systems, limiting their application to systems of only moderate complexity. This problem is addressed in the stochastic activity networks (SANs) by developing base model construction methods that account for symmetries in SAN structure and are tailored to the variable in question (e.g. response time, time to failure, etc.). It is found that such a technique can yield dramatic reductions in state-space size while preserving stochastic properties required for practical means of solution. This technique permits direct construction of a reduced base model, thus avoiding size limitations associated with more traditional approaches to model amplification.<>