发布求助
文献互助 智能选刊 最新文献

2009 Sixth International Conference on the Quantitative Evaluation of Systems最新文献

筛选
英文 中文
Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes 利用准生与死过程中的受限过渡
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.18
Juan F. Pérez, B. V. Houdt
{"title":"Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes","authors":"Juan F. Pérez, B. V. Houdt","doi":"10.1109/QEST.2009.18","DOIUrl":"https://doi.org/10.1109/QEST.2009.18","url":null,"abstract":"In this paper we consider Quasi-Birth-and-Death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase space. This property is exploited to reduce the computation time to find the matrix R or G of the process. The reduction is done through the definition of a censored process which can be of the M/G/1- or GI/M/1-type. The approach is illustrated through examples that show the applicability and benefits of making use of the additional structure. The examples also show how these special structures arise naturally in the analysis of queuing systems. Even more substantial gains can be realized when we further restrict the class of QBD processes under consideration.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117261150","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}
引用次数: 4
Recent Extensions to Traviando 最近对travando的扩展
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.30
P. Kemper
{"title":"Recent Extensions to Traviando","authors":"P. Kemper","doi":"10.1109/QEST.2009.30","DOIUrl":"https://doi.org/10.1109/QEST.2009.30","url":null,"abstract":"Traviando is a trace analyzer and visualizer for simulation traces of discrete event dynamic systems. In this paper, we briefly outline recent extensions of Traviando towards an identification of model invariants and a detection of partial deadlocks and immediate events. This new functionality complements an existing model-checker and event browser. In addition to the graphical user interface, a new command-line version of the tool allows a user to obtain analysis results being documented in a set of generated web pages, which minimizes the learning curve for the use of Traviando to obtain some feedback on the details of a simulation run.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865336","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}
引用次数: 0
A Modest Approach to Checking Probabilistic Timed Automata 检验概率时间自动机的一种适度方法
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.41
A. Hartmanns, H. Hermanns
{"title":"A Modest Approach to Checking Probabilistic Timed Automata","authors":"A. Hartmanns, H. Hermanns","doi":"10.1109/QEST.2009.41","DOIUrl":"https://doi.org/10.1109/QEST.2009.41","url":null,"abstract":"Probabilistic timed automata (PTA) combine discrete probabilistic choice, real time and nondeterminism. This paper presents a fully automatic tool for model checking PTA with respect to probabilistic and expected reachability properties. PTA are specified in Modest, a high-level compositional modelling language that includes features such as exception handling, dynamic parallelism and recursion, and thus enables model specification in a convenient fashion. For model checking, we use an integral semantics of time, representing clocks with bounded integer variables. This makes it possible to use the probabilistic model checker PRISM as analysis backend. We describe details of the approach and its implementation, and report results obtained for three different case studies.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131238674","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}
引用次数: 78
Modular Construction of Dependability Models from System Architecture Models: A Tool-Supported Approach 从系统架构模型构建可靠性模型的模块化:一种工具支持的方法
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.32
M. Magyar, I. Majzik
{"title":"Modular Construction of Dependability Models from System Architecture Models: A Tool-Supported Approach","authors":"M. Magyar, I. Majzik","doi":"10.1109/QEST.2009.32","DOIUrl":"https://doi.org/10.1109/QEST.2009.32","url":null,"abstract":"Model based dependability analysis can be used to evaluate the effects of architectural choices on system level availability and reliability. In component based systems the dependability model is built typically from sub-models that are assigned to components or subsystems and represent the local fault occurrences and error propagation. We describe the design and application of a tool that is able to construct the system level dependability model from these sub-models automatically, on the basis of the architecture model of the system. In our tool currently UML architecture model and Stochastic Activity Networks dependability model formalism are supported.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117310430","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}
引用次数: 3
COBAREA: The COpula-BAsed REliability and Availability Modeling Environment coarea:基于copula的可靠性和可用性建模环境
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.22
M. Walter, S. Esch, P. Limbourg
{"title":"COBAREA: The COpula-BAsed REliability and Availability Modeling Environment","authors":"M. Walter, S. Esch, P. Limbourg","doi":"10.1109/QEST.2009.22","DOIUrl":"https://doi.org/10.1109/QEST.2009.22","url":null,"abstract":"As an alternative to fault trees being able to deal with inter-component dependencies, we present a tool based on copulas. Copulas are a way of specifying joint distributions if only the marginal probabilities are known. In terms of system reliability, this can be interpreted as inferring the system state vector probability from the component state probabilities. What makes copulas a valuable modeling method for large reliability models isthe separation of the component distributions (the marginals) and the dependencies. Therefore, copulas can be used with arbitrary fault tree evaluation algorithms.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699786","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}
引用次数: 3
On the Impact of Modelling Choices for Distributed Information Spread 论建模选择对分布式信息传播的影响
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-05 DOI: 10.1109/QEST.2009.37
R. Bakhshi, A. Fehnker
{"title":"On the Impact of Modelling Choices for Distributed Information Spread","authors":"R. Bakhshi, A. Fehnker","doi":"10.1109/QEST.2009.37","DOIUrl":"https://doi.org/10.1109/QEST.2009.37","url":null,"abstract":"We consider a distributed shuf¿ing algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The behavior of the algorithm is probabilistic in nature; a node chooses a random peer and sends a random subset of its local data. Moreover, the algorithm exhibits nondeterministic behavior; the order in which nodes initiate an exchange is not speci¿ed. For the shuf¿ing algorithm we build several formal models using the probabilistic model checker PRISM. Despite of the well known state-space explosion problem, we were able to model a network of up to 15 nodes. In addition, we implement two equational models in MATLAB, a discrete model and its continuous alternative, as well as the algorithm itself in the peer-to-peer network simulator PeerSim. By comparing different modelling frameworks, we further explore the impact of modelling choices, such as different scheduling policies and the notion of rounds. The evaluation of distributed protocols, especially gossiping protocols, is dif¿cult and a comparison of different evaluation techniques is greatly desired, since the evaluation techniques vary a lot and are based on different assumptions. The comparison of different models allowed us to discover hidden assumptions, which helps with the interpretation of the obtained results.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629057","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}
引用次数: 10
GTAexpress: A Software Package to Handle Kronecker Descriptors GTAexpress:处理Kronecker描述符的软件包
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-01 DOI: 10.1109/QEST.2009.26
R. Czekster, Paulo Fernandes, T. Webber
{"title":"GTAexpress: A Software Package to Handle Kronecker Descriptors","authors":"R. Czekster, Paulo Fernandes, T. Webber","doi":"10.1109/QEST.2009.26","DOIUrl":"https://doi.org/10.1109/QEST.2009.26","url":null,"abstract":"This paper presents a software package, called GTAexpress, to handle structured continuous-time Markovian models expressed using Generalized Tensor Algebra, also known as, Kronecker descriptors. The proposed software package has the most advanced methods to provide stationary and transient solutions as well as some basic structural properties of models represented as a sum of generalized tensor products. Other software tools already provide some approaches based on tensor representation, like, PEPS and SMART. However, such tools are bounded to a specific modeling formalism. The basic idea of GTAexpress is to provide Kronecker descriptor-based solutions that can be easily used as a package in new tools or as a library in the existing high-level formalisms tools.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097938","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}
引用次数: 23
The Multi-branched Method of Moments for Queueing Networks 排队网络矩的多分支方法
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-02-17 DOI: 10.1109/QEST.2009.48
G. Casale
{"title":"The Multi-branched Method of Moments for Queueing Networks","authors":"G. Casale","doi":"10.1109/QEST.2009.48","DOIUrl":"https://doi.org/10.1109/QEST.2009.48","url":null,"abstract":"We propose a new exact solution algorithm for closed multiclass product-form queueing networks that is several orders of magnitude faster and less memory consuming than established methods for multiclass models, such as the Mean Value Analysis (MVA) algorithm. The technique generalizes the recently proposed Method of Moments (MoM) which, differently from MVA, recursively computes {higher-order} moments of queue lengths instead of mean values. The main contribution of this paper is to show that the information used in the MoM recursion can be increased by considering multiple recursive branches that evaluate models with fewer queues. This reformulation allows to define a simpler matrix difference equation for computing normalizing constants which leads to large computational savings with respect to the MoM recursion. Computational analysis shows many cases where the proposed algorithm is between 1,000 and 10,000 times faster and less memory consuming than MoM, thus extending the range of multiclass models where exact solutions are feasible.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133451739","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}
引用次数: 1
Mean-Field Analysis for the Evaluation of Gossip Protocols 八卦协议评价的平均场分析
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2008-11-30 DOI: 10.1145/1481506.1481513
R. Bakhshi, L. Cloth, W. Fokkink, B. Haverkort
{"title":"Mean-Field Analysis for the Evaluation of Gossip Protocols","authors":"R. Bakhshi, L. Cloth, W. Fokkink, B. Haverkort","doi":"10.1145/1481506.1481513","DOIUrl":"https://doi.org/10.1145/1481506.1481513","url":null,"abstract":"Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial view of the global system. Because of the size of these networks, analysis of gossip protocols is mostly done using simulations, that tend to be expensive in computation time and memory consumption. We employ mean-¿eld approximation for an analytical evaluation of gossip protocols. Nodes in the network are represented by small identical stochastic models. Joining all nodes would result in an enormous stochastic process. If the number of nodes goes to in¿nity, however, mean-¿eld analysis allows us to replace this intractably large stochastic process by a small deterministic process. This process approximates the behaviour of very large gossip networks, and can be evaluated using simple matrix-vector multiplications.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131798985","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}
引用次数: 56
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书