J. Bradley, N. Dingle, P. Harrison, W. Knottenbelt
{"title":"扩展连续随机逻辑半马尔可夫随机Petri网的性能查询","authors":"J. Bradley, N. Dingle, P. Harrison, W. Knottenbelt","doi":"10.1109/PNPM.2003.1231543","DOIUrl":null,"url":null,"abstract":"Semi-Markov Stochastic Petri Nets (SM-SPNs) are a highlevel formalism for defining semi-Markov processes. We present an extended Continuous Stochastic Logic (eCSL) which provides an expressive way to articulate performance queries at the SM-SPN model level. eCSL supports queries involving steady-state, transient and passage time measures. We demonstrate this by formulating and answering eCSL queries on an SM-SPN model of a distributed voting system with up to states.","PeriodicalId":134699,"journal":{"name":"10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Performance queries on semi-Markov stochastic Petri nets with an extended continuous stochastic logic\",\"authors\":\"J. Bradley, N. Dingle, P. Harrison, W. Knottenbelt\",\"doi\":\"10.1109/PNPM.2003.1231543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Semi-Markov Stochastic Petri Nets (SM-SPNs) are a highlevel formalism for defining semi-Markov processes. We present an extended Continuous Stochastic Logic (eCSL) which provides an expressive way to articulate performance queries at the SM-SPN model level. eCSL supports queries involving steady-state, transient and passage time measures. We demonstrate this by formulating and answering eCSL queries on an SM-SPN model of a distributed voting system with up to states.\",\"PeriodicalId\":134699,\"journal\":{\"name\":\"10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings.\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.2003.1231543\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.2003.1231543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance queries on semi-Markov stochastic Petri nets with an extended continuous stochastic logic
Semi-Markov Stochastic Petri Nets (SM-SPNs) are a highlevel formalism for defining semi-Markov processes. We present an extended Continuous Stochastic Logic (eCSL) which provides an expressive way to articulate performance queries at the SM-SPN model level. eCSL supports queries involving steady-state, transient and passage time measures. We demonstrate this by formulating and answering eCSL queries on an SM-SPN model of a distributed voting system with up to states.