{"title":"Close form derivation of state-density functions over DBM domains in the analysis of non-Markovian models","authors":"A. Donaldson, Alice Miller, D. Parker","doi":"10.1109/QEST.2007.23","DOIUrl":"https://doi.org/10.1109/QEST.2007.23","url":null,"abstract":"Quantitative evaluation of models allowing multiple concurrent non-exponential timers requires enumeration and analysis of non-Markovian processes. In general, these processes may be not isomorphic to those obtained from the corresponding untimed models, due to implicit precedences induced by timing constraints on concurrent events. The analysis of stochastic Time Petri Nets (sTPNs) copes with the problem by covering the state space with stochastic classes, which extend Difference Bounds Matrix (DBM) theory with a state density function providing a measure of probability for the variety of states collected within a class. In this paper, we extend the theory of stochastic classes providing a close form calculus for the derivation of the state density function under the assumption that all transitions have an expolynomial distribution. The characterization provides insight on how the form of the state density function evolves when transitions fire and the stochastic class accumulates memory and provide the basis for an efficient implementation which drastically reduces analysis complexity.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121936030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The ipclib PEPA Library","authors":"Allan Clark","doi":"10.1109/QEST.2007.20","DOIUrl":"https://doi.org/10.1109/QEST.2007.20","url":null,"abstract":"PEPA[6] is a popular stochastic process algebra which allows a compositional approach to stochastic model description. The ipc compiler translates a given PEPA model into a format suitable for processing by the Hydra[5] Markovian response-time analyser. The ipc software has undergone some improvements which have led to its refactoring as a library for handling PEPA models.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134006024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CSL^TA: an Expressive Logic for Continuous-Time Markov Chains","authors":"S. Donatelli, S. Haddad, J. Sproston","doi":"10.1109/QEST.2007.40","DOIUrl":"https://doi.org/10.1109/QEST.2007.40","url":null,"abstract":"The stochastic temporal logic CSL can be used to describe formally properties of continuous-time Markov chains, and has been extended with expressions over states and actions to obtain the logic asCSL. However, properties referring to the probability of a finite sequence of timed events (such as \"with probability at least 0.75, the system will be in state set A at time 5, then in state set B at time 7, then in state set C at time 20\") cannot be expressed in either CSL or asCSL. With the aim of increasing the expressive power of temporal logics for continuous- time Markov chains, we introduce the logic CSLTA and its model-checking algorithm. CSLTA extends CSL and asCSL by allowing the specification of timed properties through a deterministic one-clock timed automata.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Brenner, Paulo Fernandes, B. Plateau, Ihab Sbeity
{"title":"GRIP: Generic Representatives in PRISM","authors":"L. Brenner, Paulo Fernandes, B. Plateau, Ihab Sbeity","doi":"10.1109/QEST.2007.30","DOIUrl":"https://doi.org/10.1109/QEST.2007.30","url":null,"abstract":"We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Closed G-networks with Resets: product form solution","authors":"J. Fourneau","doi":"10.1109/QEST.2007.39","DOIUrl":"https://doi.org/10.1109/QEST.2007.39","url":null,"abstract":"We consider a closed queueing network of generalized queues with customers and signals. each queue has an infinite capacity and one server. the service time is exponential. after its service completion a customer moves to another queue and may become a signal. when the signal enters a non empty queue it vanishes while it resets the queue when it enters an empty queue. we prove that the steady state-distribution for such a closed network of queues has a product form solution. to the best of our knowledge it is the first closed network of generalized queues with product form solution. we also consider a more complex system where the reset acts upon a set of queues rather than a single one. we also prove that the steady-state distribution exists and has a product form.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Probabilistic Model-Checking Support for FMEA","authors":"Lars Grunske, R. Colvin, Kirsten Winter","doi":"10.1109/QEST.2007.18","DOIUrl":"https://doi.org/10.1109/QEST.2007.18","url":null,"abstract":"Failure Mode and Effect Analysis (FMEA) is a method for assessing cause-consequence relations between component faults and hazards that may occur during the lifetime of a system. The analysis is typically time intensive and informal, and for this reason FMEA has been extended with traditional model checking support. Such support does not take into account the probabilities associated with a component fault occurring, yet such information is crucial to developing hazard reduction strategies for a system. In this paper we propose a method for FMEA which makes use of probabilistic fault injection and probabilistic model checking. Based on this approach safety engineers are able to formally identify if a failure mode occurs with a probability higher than its tolerable hazard rate.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130023375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}