{"title":"Searching best paths to worst states","authors":"G. Florin, C. Fraize, S. Natkin","doi":"10.1109/PNPM.1991.238800","DOIUrl":null,"url":null,"abstract":"Probabilistic validation is a new approach to deal with large state transitions systems. The user's need is to prove that, for a given period of operations, that a given assertion on the reached states is true with a sufficient level of probability. The system to be validated is modeled by a stochastic Petri net. The analysis relies on a partial exploration of the reachability set and tries to reach as quickly as possible critical states (states in which the assertion is not verified). An exact linear program solution allows to 'travel' through the graph. The main goal of the paper is to present the principles of this searching algorithm.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","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.238800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Probabilistic validation is a new approach to deal with large state transitions systems. The user's need is to prove that, for a given period of operations, that a given assertion on the reached states is true with a sufficient level of probability. The system to be validated is modeled by a stochastic Petri net. The analysis relies on a partial exploration of the reachability set and tries to reach as quickly as possible critical states (states in which the assertion is not verified). An exact linear program solution allows to 'travel' through the graph. The main goal of the paper is to present the principles of this searching algorithm.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
