首页 > 最新文献

Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)最新文献

英文 中文
A Generic Mean Field Convergence Result for Systems of Interacting Objects 相互作用对象系统的一般平均场收敛结果
J. Boudec, D. McDonald, Jochen Mundinger
We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wide applicability; we mention as examples: TCP connections, HTTP flows, robot swarms, reputation systems. We show that when the number of objects is large, the occupancy measure of the system converges to a deterministic dynamical system (the "mean field") with dimension the number of states of an individual object. We also prove a fast simulation result, which allows to simulate the evolution of a few particular objects imbedded in a large system. We illustrate how this can be used to model the determination of reputation in large populations, with various liar strategies.
我们考虑了一个相互作用对象的模型,其中每个对象的演化由有限状态马尔可夫链给出,其转移矩阵依赖于所有对象的状态分布的现在和过去。这是一个具有广泛适用性的一般模型;我们举的例子有:TCP连接、HTTP流、机器人群、信誉系统。我们表明,当物体数量很大时,系统的占用度量收敛到一个确定性动力系统(“平均场”),其维度为单个物体的状态数。我们还证明了一个快速的仿真结果,它允许模拟嵌入在一个大系统中的几个特定对象的演化。我们说明了如何使用这一模型来确定大量人群的声誉,并采用各种说谎者策略。
{"title":"A Generic Mean Field Convergence Result for Systems of Interacting Objects","authors":"J. Boudec, D. McDonald, Jochen Mundinger","doi":"10.1109/QEST.2007.3","DOIUrl":"https://doi.org/10.1109/QEST.2007.3","url":null,"abstract":"We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wide applicability; we mention as examples: TCP connections, HTTP flows, robot swarms, reputation systems. We show that when the number of objects is large, the occupancy measure of the system converges to a deterministic dynamical system (the \"mean field\") with dimension the number of states of an individual object. We also prove a fast simulation result, which allows to simulate the evolution of a few particular objects imbedded in a large system. We illustrate how this can be used to model the determination of reputation in large populations, with various liar strategies.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115051148","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}
引用次数: 185
Simultaneous Transient Analysis of QBD Markov Chains for all Initial Configurations using a Level Based Recursion 基于水平递归的所有初始构型QBD马尔可夫链同时瞬态分析
J. V. Velthoven, B. V. Houdt, C. Blondia
A new algorithm to assess transient performance measures for every possible initial configuration of a quasi-birth-and-death (QBD) Markov chain is introduced. We make use of the framework termed QBDs with marked time epochs that transforms the transient problem into a stationary one by applying a discrete Erlangization and constructing a reset Markov chain. To avoid the need to repeat ail computations for each initial configuration, we propose a level based recursive algorithm that uses intermediate results obtained for initial states belonging to levels 0,hellip, tau - 1 to compute the transient measure when the initial state is part of level tau. Also, the computations for all states belonging to level tau are performed simultaneously. A key property of our approach lies in the exploitation of the internal structure of the block matrices involved, avoiding any need to store large matrices. A flexible Matlab implementation of the proposed algorithm is available online.
提出了一种评估准生-死(QBD)马尔可夫链各种可能初始构型的暂态性能度量的新算法。我们利用带有标记时间点的qbd框架,通过应用离散埃尔朗化和构造重置马尔可夫链,将瞬态问题转化为平稳问题。为了避免对每个初始配置重复所有计算的需要,我们提出了一种基于级别的递归算法,该算法使用属于级别0,hellip, tau - 1的初始状态获得的中间结果来计算初始状态为级别tau的一部分时的瞬态度量。同时,对属于tau层的所有状态进行计算。我们的方法的一个关键特性在于利用了所涉及的块矩阵的内部结构,避免了任何存储大矩阵的需要。该算法的一个灵活的Matlab实现可以在网上找到。
{"title":"Simultaneous Transient Analysis of QBD Markov Chains for all Initial Configurations using a Level Based Recursion","authors":"J. V. Velthoven, B. V. Houdt, C. Blondia","doi":"10.1109/QEST.2007.21","DOIUrl":"https://doi.org/10.1109/QEST.2007.21","url":null,"abstract":"A new algorithm to assess transient performance measures for every possible initial configuration of a quasi-birth-and-death (QBD) Markov chain is introduced. We make use of the framework termed QBDs with marked time epochs that transforms the transient problem into a stationary one by applying a discrete Erlangization and constructing a reset Markov chain. To avoid the need to repeat ail computations for each initial configuration, we propose a level based recursive algorithm that uses intermediate results obtained for initial states belonging to levels 0,hellip, tau - 1 to compute the transient measure when the initial state is part of level tau. Also, the computations for all states belonging to level tau are performed simultaneously. A key property of our approach lies in the exploitation of the internal structure of the block matrices involved, avoiding any need to store large matrices. A flexible Matlab implementation of the proposed algorithm is available online.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122117545","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}
引用次数: 11
A Productivity Centered Tools Framework for Application Performance Tuning 一个以生产力为中心的应用程序性能调优工具框架
H. Wen, S. Sbaraglia, Seetharami R. Seelam, I. Chung, Guojing Cong, D. Klepacki
Our productivity centered performance tuning framework for HPC applications comprises of three main components: (1) a versatile source code, performance metrics, and performance data visualization and analysis graphical user interface, (2) a unique source code and binary instrumentation engine, and (3) an array of data collection facilities to gather performance data across various dimensions including CPU, message passing, threads, memory and I/O. We believe that the ability to decipher performance impacts at the source level and the ability to probe the application with different tools at the same time at varying granularities, while hiding the complications of binary instrumentation, leads to higher productivity of scientists in understanding and tuning the performance of associated computing systems and applications.
我们的高性能计算应用程序以生产力为中心的性能调优框架包括三个主要组件:(1)通用源代码、性能指标、性能数据可视化和分析图形用户界面;(2)独特的源代码和二进制仪表引擎;(3)一系列数据收集工具,用于收集各种维度的性能数据,包括CPU、消息传递、线程、内存和I/O。我们相信,在源级别破译性能影响的能力,以及在不同粒度同时使用不同工具探测应用程序的能力,同时隐藏二进制仪器的复杂性,可以提高科学家在理解和调整相关计算系统和应用程序的性能方面的生产力。
{"title":"A Productivity Centered Tools Framework for Application Performance Tuning","authors":"H. Wen, S. Sbaraglia, Seetharami R. Seelam, I. Chung, Guojing Cong, D. Klepacki","doi":"10.1109/QEST.2007.14","DOIUrl":"https://doi.org/10.1109/QEST.2007.14","url":null,"abstract":"Our productivity centered performance tuning framework for HPC applications comprises of three main components: (1) a versatile source code, performance metrics, and performance data visualization and analysis graphical user interface, (2) a unique source code and binary instrumentation engine, and (3) an array of data collection facilities to gather performance data across various dimensions including CPU, message passing, threads, memory and I/O. We believe that the ability to decipher performance impacts at the source level and the ability to probe the application with different tools at the same time at varying granularities, while hiding the complications of binary instrumentation, leads to higher productivity of scientists in understanding and tuning the performance of associated computing systems and applications.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115496305","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 PEPA Plug-in Project PEPA插件项目
Lars Grunske, R. Colvin, Kirsten Winter
We present a GUI-based tool supporting the stochastic process algebra PEPA with modules for performance evaluation through Markovian steady-state analysis, fluid flow analysis, and stochastic simulation.
我们提出了一个基于gui的工具,支持随机过程代数PEPA,其中包含通过马尔可夫稳态分析,流体流动分析和随机模拟进行性能评估的模块。
{"title":"The PEPA Plug-in Project","authors":"Lars Grunske, R. Colvin, Kirsten Winter","doi":"10.1109/QEST.2007.34","DOIUrl":"https://doi.org/10.1109/QEST.2007.34","url":null,"abstract":"We present a GUI-based tool supporting the stochastic process algebra PEPA with modules for performance evaluation through Markovian steady-state analysis, fluid flow analysis, and stochastic simulation.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115186717","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}
引用次数: 124
Analysis of Local Address Scanning by Puppetnets 木偶网本地地址扫描分析
D. Nicol
Puppetnets are created when a web server hosts a page that when loaded simultaneously by many users causes malicious behavior; there are a wide variety of means by which puppetnets can cause mischief. This paper analyzes the behavior and effectiveness of puppetnets for Internet reconnaissance-methodical means of discovering live IP addresses-as a prelude to another attack. We consider local reconnaissance, in which the client reconnoiters addresses in its local IP neighborhood. We focus on mod eling critical facets that impact coverag-the fraction of addresses analyzed-as a function of time. We prove that certain scanning strategies are superior to others, and de velop formulae that describe the inefficiencies due to lack of coordination. Finally we use the model to estimate how global Internet coverage grows as a function of time, under generous assumptions about the size of puppetnet and length of script execution. We see that even a strategy that focuses on exploring blocks of adjacent live addresses may take days to map a significant fraction of the Internet address space.
当一个web服务器托管一个页面,当许多用户同时加载导致恶意行为时,就会创建木偶;木偶可以通过各种各样的方式造成恶作剧。本文分析了木偶网络的行为和有效性,用于互联网侦察-发现实时IP地址的方法-作为另一次攻击的前奏。我们考虑本地侦察,其中客户端在其本地IP邻居中侦察地址。我们专注于建模影响覆盖率的关键方面——被分析地址的比例——作为时间的函数。我们证明了某些扫描策略优于其他策略,并开发了描述由于缺乏协调而导致的低效率的公式。最后,我们使用该模型来估计全球互联网覆盖率如何随着时间的推移而增长,假设木偶网络的大小和脚本执行的长度。我们看到,即使是专注于探索相邻实时地址块的策略,也可能需要数天才能映射出互联网地址空间的很大一部分。
{"title":"Analysis of Local Address Scanning by Puppetnets","authors":"D. Nicol","doi":"10.1109/QEST.2007.45","DOIUrl":"https://doi.org/10.1109/QEST.2007.45","url":null,"abstract":"Puppetnets are created when a web server hosts a page that when loaded simultaneously by many users causes malicious behavior; there are a wide variety of means by which puppetnets can cause mischief. This paper analyzes the behavior and effectiveness of puppetnets for Internet reconnaissance-methodical means of discovering live IP addresses-as a prelude to another attack. We consider local reconnaissance, in which the client reconnoiters addresses in its local IP neighborhood. We focus on mod eling critical facets that impact coverag-the fraction of addresses analyzed-as a function of time. We prove that certain scanning strategies are superior to others, and de velop formulae that describe the inefficiencies due to lack of coordination. Finally we use the model to estimate how global Internet coverage grows as a function of time, under generous assumptions about the size of puppetnet and length of script execution. We see that even a strategy that focuses on exploring blocks of adjacent live addresses may take days to map a significant fraction of the Internet address space.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130289719","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
Performance Trees: Expressiveness and Quantitative Semantics 性能树:表达性和定量语义
T. Suto, J. Bradley, W. Knottenbelt
Performance trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics, since they support traditional stochastic model checking queries, while also allowing for the direct extraction of a wide range of quantitative measures. In this paper we illustrate differences in expressiveness between performance trees and continuous stochastic logic (CSL), and present quantitative semantics showing the mathematical basis underlying performance tree operators. As a running example, we demonstrate performance query specification with performance trees on a stochastic Petri net model of a healthcare system.
性能树是最近提出的一种用于规范性能属性和度量的机制。它们代表了随机逻辑的一个有吸引力的替代方案,因为它们支持传统的随机模型检查查询,同时也允许直接提取广泛的定量度量。本文阐述了性能树与连续随机逻辑(CSL)在表达性上的差异,并给出了性能树算子的数学基础的定量语义。作为一个运行的示例,我们在医疗保健系统的随机Petri网模型上演示了带有性能树的性能查询规范。
{"title":"Performance Trees: Expressiveness and Quantitative Semantics","authors":"T. Suto, J. Bradley, W. Knottenbelt","doi":"10.1109/QEST.2007.9","DOIUrl":"https://doi.org/10.1109/QEST.2007.9","url":null,"abstract":"Performance trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics, since they support traditional stochastic model checking queries, while also allowing for the direct extraction of a wide range of quantitative measures. In this paper we illustrate differences in expressiveness between performance trees and continuous stochastic logic (CSL), and present quantitative semantics showing the mathematical basis underlying performance tree operators. As a running example, we demonstrate performance query specification with performance trees on a stochastic Petri net model of a healthcare system.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116625216","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}
引用次数: 16
PEPS2007 - Stochastic Automata Networks Software Tool 随机自动机网络软件工具
L. Brenner, Paulo Fernandes, B. Plateau, Ihab Sbeity
PEPS is a tool package for modeling and solving models expressed in Stochastic Automata Networks fS AN J. The SAN formalism defines a compact storage scheme for the transition matrix of the Markov chain and it uses tensor algebra to handle the basic vector matrix multiplications. This paper presents a short timeline of PEPS previous versions and the new features included in version 2007.
PEPS是一个用于建模和求解随机自动机网络中表达的模型的工具包。SAN形式化定义了马尔可夫链转移矩阵的紧凑存储方案,并使用张量代数来处理基本向量矩阵乘法。本文简要介绍了PEPS以前版本和2007版本中包含的新特性的时间轴。
{"title":"PEPS2007 - Stochastic Automata Networks Software Tool","authors":"L. Brenner, Paulo Fernandes, B. Plateau, Ihab Sbeity","doi":"10.1109/QEST.2007.33","DOIUrl":"https://doi.org/10.1109/QEST.2007.33","url":null,"abstract":"PEPS is a tool package for modeling and solving models expressed in Stochastic Automata Networks fS AN J. The SAN formalism defines a compact storage scheme for the transition matrix of the Markov chain and it uses tensor algebra to handle the basic vector matrix multiplications. This paper presents a short timeline of PEPS previous versions and the new features included in version 2007.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122387600","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}
引用次数: 5
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping 基于签名的最优马尔可夫链集总符号算法
Salem Derisavi
Many approaches to tackle the state-space explosion problem of Markov chains are based on the notion of lumpability (a.k.a. probabilistic bisimulation), which allows computation of measures using the quotient Markov chain, which, in some cases, has much smaller state space than the original one. We present a new signature-based algorithm for computing the optimal (i.e., smallest possible) quotient Markov chain, prove its correctness, and implement it symbolically for Markov chains represented as Multi-Terminal BDDs (MTBDDs). The algorithm is very time-efficient because we translate the core operation of the algorithm, i.e., the computation of the signatures, into symbolic operations. Our experiments on various configurations of three example models with different levels of lump ability show that the algorithm (1) handles significantly larger state spaces than an explicit algorithm, (2) outperforms a very efficient explicit algorithm for significantly lump able Markov chains while it is not prohibitively slower in the worst case, and (3) outperforms our previous optimal symbolic algorithm [10] in terms of running time although it has higher space requirement for most of the configurations.
许多解决马尔可夫链状态空间爆炸问题的方法都是基于集总性(又称概率双模拟)的概念,它允许使用商马尔可夫链来计算度量,在某些情况下,它的状态空间比原来的状态空间小得多。我们提出了一种新的基于签名的计算最优(即最小可能)商马尔可夫链的算法,证明了它的正确性,并对表示为多终端bdd (mtbdd)的马尔可夫链进行了符号化实现。由于我们将算法的核心操作,即签名的计算,转换为符号操作,因此该算法非常省时。我们对具有不同级别块能力的三个示例模型的各种配置进行的实验表明,该算法(1)处理的状态空间明显大于显式算法,(2)对于显式可块马尔可夫链,它的性能优于非常有效的显式算法,而在最坏的情况下,它并不慢得惊人。(3)在运行时间上优于我们之前的最优符号算法[10],尽管它对大多数配置都有更高的空间需求。
{"title":"Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping","authors":"Salem Derisavi","doi":"10.1109/QEST.2007.27","DOIUrl":"https://doi.org/10.1109/QEST.2007.27","url":null,"abstract":"Many approaches to tackle the state-space explosion problem of Markov chains are based on the notion of lumpability (a.k.a. probabilistic bisimulation), which allows computation of measures using the quotient Markov chain, which, in some cases, has much smaller state space than the original one. We present a new signature-based algorithm for computing the optimal (i.e., smallest possible) quotient Markov chain, prove its correctness, and implement it symbolically for Markov chains represented as Multi-Terminal BDDs (MTBDDs). The algorithm is very time-efficient because we translate the core operation of the algorithm, i.e., the computation of the signatures, into symbolic operations. Our experiments on various configurations of three example models with different levels of lump ability show that the algorithm (1) handles significantly larger state spaces than an explicit algorithm, (2) outperforms a very efficient explicit algorithm for significantly lump able Markov chains while it is not prohibitively slower in the worst case, and (3) outperforms our previous optimal symbolic algorithm [10] in terms of running time although it has higher space requirement for most of the configurations.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133899637","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}
引用次数: 5
Basic Observables for Probabilistic May Testing 概率检验的基本观测值
Maria Carla Palmeri, R. Nicola, M. Massink
The definition of behavioural preorders over process terms as the maximal (pre-)congruences induced by basic observables has proven to be a useful technique to define various preorders and equivalences in the non-probabilistic setting. In this paper, we consider probabilistic observables to define an observational semantics for a probabilistic process calculus. The resulting pre-congruence is proven to coincide with a probabilistic may preorder, which, in turn, corresponds to a natural probabilistic extension of the may testing preorder of De Nicola and Hennessy.
将过程项上的行为预定顺序定义为由基本可观测值引起的最大(预)同余,已被证明是在非概率设置中定义各种预定顺序和等价的有用技术。在本文中,我们考虑概率可观测值来定义一个概率过程演算的观测语义。由此产生的预同余被证明与概率的可能预序一致,这反过来又对应于De Nicola和Hennessy的可能测试预序的自然概率扩展。
{"title":"Basic Observables for Probabilistic May Testing","authors":"Maria Carla Palmeri, R. Nicola, M. Massink","doi":"10.1109/QEST.2007.19","DOIUrl":"https://doi.org/10.1109/QEST.2007.19","url":null,"abstract":"The definition of behavioural preorders over process terms as the maximal (pre-)congruences induced by basic observables has proven to be a useful technique to define various preorders and equivalences in the non-probabilistic setting. In this paper, we consider probabilistic observables to define an observational semantics for a probabilistic process calculus. The resulting pre-congruence is proven to coincide with a probabilistic may preorder, which, in turn, corresponds to a natural probabilistic extension of the may testing preorder of De Nicola and Hennessy.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"25 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":"117337691","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}
引用次数: 14
Model checking the probabilistic pi-calculus 模型检验的概率pi演算
G. Norman, C. Palamidessi, D. Parker, Peng Wu
We present an implementation of model checking for the probabilistic pi-calculus-calculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour. Formal verification techniques for this calculus have clear applications in several domains, including mobile ad-hoc network protocols and random security protocols. Despite this, no implementation of automated verification exists. Building upon the (non-probabilistic) pi-calculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic pi-calculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for a large class of systems a more efficient, compositional approach can be applied, which uses our extension of MMC on each parallel component of the system and then translates the results into a high-level model description for the PRISM tool. The feasibility of our techniques is demonstrated through three case studies from the pi-calculus literature.
我们提出了一种概率pi-微积分的模型检查实现,pi-微积分是一种支持并发性、移动性和离散概率行为建模的过程代数。这种演算的形式化验证技术在几个领域有明确的应用,包括移动自组织网络协议和随机安全协议。尽管如此,仍然没有自动验证的实现。在(非概率)pi-微积分模型检查器MMC的基础上,我们首先展示了一个用于构造表示概率pi-微积分过程的马尔可夫决策过程的自动化过程。然后可以使用现有的概率模型检查器(如PRISM)来验证这一点。其次,我们演示了如何对大型系统应用更有效的组合方法,该方法在系统的每个并行组件上使用我们的MMC扩展,然后将结果转换为PRISM工具的高级模型描述。我们的技术的可行性是通过三个案例研究从pi微积分文献证明。
{"title":"Model checking the probabilistic pi-calculus","authors":"G. Norman, C. Palamidessi, D. Parker, Peng Wu","doi":"10.1109/QEST.2007.31","DOIUrl":"https://doi.org/10.1109/QEST.2007.31","url":null,"abstract":"We present an implementation of model checking for the probabilistic pi-calculus-calculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour. Formal verification techniques for this calculus have clear applications in several domains, including mobile ad-hoc network protocols and random security protocols. Despite this, no implementation of automated verification exists. Building upon the (non-probabilistic) pi-calculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic pi-calculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for a large class of systems a more efficient, compositional approach can be applied, which uses our extension of MMC on each parallel component of the system and then translates the results into a high-level model description for the PRISM tool. The feasibility of our techniques is demonstrated through three case studies from the pi-calculus literature.","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":"115541819","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}
引用次数: 24
期刊
Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1