{"title":"Time warp simulation of stochastic Petri nets","authors":"H. Ammar, S. Deng","doi":"10.1109/PNPM.1991.238802","DOIUrl":null,"url":null,"abstract":"Addresses the problem of developing parallel simulation techniques to analyze complex Stochastic Petri Net (SPN) models. The approach of parallel simulation is to divide a general SPN spatially into several connected subnets. The various subnetworks are simulated in parallel by several logical processes (LPs) which synchronize. The rich and complex structure of Petri Nets necessitates the development of an algorithm which can handle general forms of network partitions. In the paper, an algorithm based on the Time Warp strategy for optimistic parallel simulation is presented. Time scale decomposition is also used with spatial decomposition to induce parallelism and reduce synchronization overhead. An example of performability analysis using both spatial and time-scale decomposition is presented.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1991.238802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
Addresses the problem of developing parallel simulation techniques to analyze complex Stochastic Petri Net (SPN) models. The approach of parallel simulation is to divide a general SPN spatially into several connected subnets. The various subnetworks are simulated in parallel by several logical processes (LPs) which synchronize. The rich and complex structure of Petri Nets necessitates the development of an algorithm which can handle general forms of network partitions. In the paper, an algorithm based on the Time Warp strategy for optimistic parallel simulation is presented. Time scale decomposition is also used with spatial decomposition to induce parallelism and reduce synchronization overhead. An example of performability analysis using both spatial and time-scale decomposition is presented.<>