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

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

筛选
英文 中文
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process BMAP/MAP/1出发过程两种输出模型的比较
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.23
Qi Zhang, A. Heindl, E. Smirni, A. Stathopoulos
{"title":"Comparison of Two Output Models for the BMAP/MAP/1 Departure Process","authors":"Qi Zhang, A. Heindl, E. Smirni, A. Stathopoulos","doi":"10.1109/QEST.2009.23","DOIUrl":"https://doi.org/10.1109/QEST.2009.23","url":null,"abstract":"The departure process of a BMAP/MAP/1 queuecan be approximated in different ways: as a Markovian arrivalprocess (MAP) or as a matrix-exponential process (MEP).Both approximations are finite truncations (say, with n + 1block levels) of the original departure process and preservethe marginal distribution of the interdeparture times. However,for true batch arrivals, the MAP model matches one morecoefficient of correlation than the MEP of corresponding size,i.e., lag correlations of the interdeparture times up to lag (n−1)– as opposed to (n − 2) for MEP models. In this paper, wecompare the two families of output approximations: we analyzethe related complexity with respect to both the computation ofoutput characteristics and the use of the models in networkdecomposition. We also investigate the potential differencesin capturing the asymptotic behavior of the autocorrelationfunction via an eigenvalue analysis. Numerical experiments,conducted for both output models, reveal the implications in anetwork decomposition of dual tandem queues.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"56 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":"127529184","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
Acyclic Minimality by Construction---Almost 通过构造实现无循环最小化——几乎
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.45
Reza Pulungan, H. Hermanns
{"title":"Acyclic Minimality by Construction---Almost","authors":"Reza Pulungan, H. Hermanns","doi":"10.1109/QEST.2009.45","DOIUrl":"https://doi.org/10.1109/QEST.2009.45","url":null,"abstract":"Acyclic phase-type distributions are phase-type distributions with triangular matrix representations. They constitute a versatile modelling tool in many circumstances. The size of their matrix representation has a strong influence on computational efforts needed when analyzing these distributions. This representation, however, is not unique, and two representations of the same distribution can differ drastically in size. This paper explores an effective algorithm to reduce the size of the matrix representation without altering the distribution. This proceeds via a symbolic representation of the Laplace-Stieltjes transform of the phase-type distribution. The algorithm is of cubic complexity in the size of the given representation. We clarify the circumstances under which the algorithm returns a minimal representation, and discuss in how far it can keep representations minimal when they are constructed via any of three operations---convolution, minimum, and maximum. A case study modelling delay propagation in railway networks demonstrates the practicality of the approach.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"158 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":"122093819","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
Simulation + Hypothesis Testing for Model Checking of Probabilistic Systems 概率系统模型检验的仿真+假设检验
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.43
Axel Legay, Mahesh Viswanathan
{"title":"Simulation + Hypothesis Testing for Model Checking of Probabilistic Systems","authors":"Axel Legay, Mahesh Viswanathan","doi":"10.1109/QEST.2009.43","DOIUrl":"https://doi.org/10.1109/QEST.2009.43","url":null,"abstract":"Tutorial on using hypothesis testing for solving the probabilistic model checking problem.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"16 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":"132662251","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
Aggregated Stochastic State Classes in Quantitative Evaluation of non-Markovian Stochastic Petri Nets 非马尔可夫随机Petri网定量评价中的聚合随机状态类
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.33
A. Horváth, E. Vicario
{"title":"Aggregated Stochastic State Classes in Quantitative Evaluation of non-Markovian Stochastic Petri Nets","authors":"A. Horváth, E. Vicario","doi":"10.1109/QEST.2009.33","DOIUrl":"https://doi.org/10.1109/QEST.2009.33","url":null,"abstract":"The method of stochastic state classes provides a new approach for theanalysis of non-Markovian stochastic Petri Nets, which relies on thestochastic expansion of the graph of non-deterministic state classes basedon Difference Bounds Matrix (DBM) which is usually employed in qualitativeverification.In so doing, the method is able to manage multiple concurrentnon-exponential (GEN) transitions and largely extends the class of modelsthat are amenable to quantitative evaluation.However, its application requires that every cycle in the graph ofnon-deterministic state classes visits at least a regeneration point whereall GEN transitions are newly enabled.In particular, this rules out models whose non-deterministic class graphincludes cycles within a Continuous Time Markov Chain (CTMC) subordinatedto the activity period of one or more GEN transitions.In this paper, we propose an extension that overcomes thislimitation by aggregating together classes that are reachedthrough firings that do not change the enabling status of GENtransitions.This enlarges the class of models that can be analysed through themethod of stochastic state classes and makes it become a properextension of the class of models that satisfies the so calledenabling restriction.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"5 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":"131025038","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}
引用次数: 9
Locating Performance Bottlenecks in Embedded Java Software with Calling-Context Cross-Profiling 利用调用-上下文交叉分析定位嵌入式Java软件的性能瓶颈
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.40
Philippe Moret, Walter Binder, A. Villazón, Danilo Ansaloni, Martin Schoeberl
{"title":"Locating Performance Bottlenecks in Embedded Java Software with Calling-Context Cross-Profiling","authors":"Philippe Moret, Walter Binder, A. Villazón, Danilo Ansaloni, Martin Schoeberl","doi":"10.1109/QEST.2009.40","DOIUrl":"https://doi.org/10.1109/QEST.2009.40","url":null,"abstract":"Prevailing approaches to analyze embedded software performance either require the deployment of the software on the embedded target, which can be tedious and may be impossible in an early development phase, or rely on simulation, which can be extremely slow. We promote cross-profiling as an alternative approach, which is particularly well suited for embedded Java processors. The embedded software is profiled in any standard Java Virtual Machine in a host environment, but the generated cross-profile estimates the execution time on the target. We implemented our approach in the customizable cross-profiler CProf, which generates calling-context cross-profiles. Each calling-context stores dynamic metrics, such as the estimated CPU cycle consumption on the target. We visualize the generated calling-context cross-profiles as ring charts, where callee methods are represented in segments surrounding the caller's segment. As the size of each segment corresponds to the relative CPU consumption of the corresponding calling-context, the visualization eases the location of performance bottlenecks in embedded Java software, revealing hot methods, as well as their callers and callees, at one glance.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"57 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":"122996540","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
Infinite-State Verification: From Transition Systems to Markov Chains 无限状态验证:从过渡系统到马尔可夫链
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.16
P. Abdulla
{"title":"Infinite-State Verification: From Transition Systems to Markov Chains","authors":"P. Abdulla","doi":"10.1109/QEST.2009.16","DOIUrl":"https://doi.org/10.1109/QEST.2009.16","url":null,"abstract":"We present a general framework which can handle probabilistic versions of several classical models such as Petri nets, lossy channel systems, push-down automata, and noisy Turing machines.First, we describe algorithms for verification of emph{well quasi-orderedtransition systems}. These are transition systems which are monotonic w.r.t. a well quasi-ordering on the state space. Then, we extend the framework by introducing decisive Markov chains, a class of Markov chains which cover all the above mentioned models. We consider both safety and liveness problems for decisive Markov chains. Safety: What is the probability that a given set of states is eventually reached. Liveness: What is the probability that a given set of states is reached infinitely often}. We will also consider limiting behaviors for infinite-state Markov chains.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"12 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":"120960615","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
Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies 随机无线网络拓扑中连通性水平与局部复杂度之间的权衡量化
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.44
A. Faragó
{"title":"Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies","authors":"A. Faragó","doi":"10.1109/QEST.2009.44","DOIUrl":"https://doi.org/10.1109/QEST.2009.44","url":null,"abstract":"We analyze large, random network topologies that arise in ad hoc or sensor networks. A fundamental requirement of communication in these systems is reachability, that is, to have a connected network topology. It is known, however, that the price for full connectivity is very high, as it requires unbounded local complexity, i.e., it forces the nodes to have infinitely growing degrees to achieve asymptotic connectivity. This means a lack of scalability, which is known to hold for a quite general class of random network topology models. Therefore, an important step in analyzing the performance of such networks is to explore the trade-off between the fraction of nodes that still belong to a connected component vs. a bound imposed on the node degrees. We investigate this issue in a model that is more general than previously investigated random wireless network topology models. In our general model we derive an asymptotically optimal trade-off between node degrees and the fraction of nodes that form a connected component.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"23 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":"129994872","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
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains 基于随机比较的不确定马尔可夫链有效模型检验
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.42
S. Haddad, N. Pekergin
{"title":"Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains","authors":"S. Haddad, N. Pekergin","doi":"10.1109/QEST.2009.42","DOIUrl":"https://doi.org/10.1109/QEST.2009.42","url":null,"abstract":"We consider model checking of Discrete Time Markov Chains (DTMC) with transition probabilities which are not exactly known but lie in a given interval. Model checking a Probabilistic Computation Tree Logic (PCTL) formula for interval-valued DTMCs (IMC) has been shown to be NP hard and co-NP hard. Since the state space of a realistic DTMC is generally huge, these lower bounds prevent the application of exact algorithms for such models. Therefore we propose to apply the stochastic comparison method to check an extended version of PCTL for IMCs. More precisely, we first design linear time algorithms to quantitatively analyze IMCs. Then we develop an efficient, semi-decidable PCTL model checking procedure for IMCs. Furthermore, our procedure returns more refined answers than traditional ones: emph{YES, NO, DON'T KNOW}. Thus we may provide useful partial information for modelers in the `DON'T KNOW' case.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"1 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":"130216893","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}
引用次数: 17
The Bio-PEPA Tool Suite Bio-PEPA工具套件
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.27
Federica Ciocchetta, A. Duguid, S. Gilmore, M. L. Guerriero, J. Hillston
{"title":"The Bio-PEPA Tool Suite","authors":"Federica Ciocchetta, A. Duguid, S. Gilmore, M. L. Guerriero, J. Hillston","doi":"10.1109/QEST.2009.27","DOIUrl":"https://doi.org/10.1109/QEST.2009.27","url":null,"abstract":"Bio-PEPA is a timed process algebra designedspecifically for the description of biological phenomena and theiranalysis through quantitative methods such asstochastic simulation and probabilistic model-checking.Two software tools are available for modelling with Bio-PEPA, theBio-PEPA Workbench and the Bio-PEPA Eclipse Plugin. The Bio-PEPAWorkbench is the research prototype tool which allows us to try outnew language features and new types of analysis through rapidprototyping. The Bio-PEPA Eclipse Plugin is a polished modellingenvironment which targets end-users who wish to do Bio-PEPA modellingsupported by a comprehensive integrated development environment. Bothmodelling tools allow the user to analyse their model both in thediscrete stochastic regime and in the sure continuous regime whilemaintaining only a single source in the Bio-PEPA language.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"1 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":"131363022","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}
引用次数: 43
Remote Job Management in the Möbius Modeling Framework Möbius建模框架中的远程作业管理
2009 Sixth International Conference on the Quantitative Evaluation of Systems Pub Date : 2009-09-13 DOI: 10.1109/QEST.2009.50
K. Keefe, Quincy Mitchell, Eric Rozier, W. Sanders
{"title":"Remote Job Management in the Möbius Modeling Framework","authors":"K. Keefe, Quincy Mitchell, Eric Rozier, W. Sanders","doi":"10.1109/QEST.2009.50","DOIUrl":"https://doi.org/10.1109/QEST.2009.50","url":null,"abstract":"Large and complex models can often benefit from parallel execution on multiple machines. In the Möbius modeling environment, this is especially true of models for which the user wants to examine several independent configurations or parameterizations. A Remote Job Server with the capability to securely forward jobs to remote workstations or securely submit jobs via a standard batch submission system, manage these remote jobs, and collect results from the remote processes has been implemented in the tool. With the Remote Job Server, Möbius users can painlessly parallelize the execution of their models across many platforms and network topologies. This paper describes the Remote Job Server and summarizes other recent extensions to the Möbius tool.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"12 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":"127785622","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
下一页 尾页
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学术官方微信
小红书