基于价格随机Petri网的服务协同建模与分析

针对一个企业不仅重视系统性能,也重视系统成本的问题,提出了价格随机Petri网,用于系统的价格和性能分析。价格随机Petri网既具有随机Petri网在性能分析方面的优势,又能计算系统的成本,对系统的建立和改进具有宏观指导作用。基于价格随机Petri网对服务协同典型模型提出了等价化简方法,并进行了相应的证明,此方法在一定程度上提高了系统分析的效率。     

神光Ⅲ控制系统的故障建模与分析

应用混合随机Petri网对神光Ⅲ控制系统的故障进行了建模,并应用Visobj Net对建立的故障模型进行了仿真分析。网络化控制系统是一个离散和连续相结合的混合动态系统,具有动态、并发及同步等特征;神光Ⅲ控制系统就是网络化控制技术在武器装备上的一个典型应用;对于复杂系统的建模和分析,Petri网是一个非常有效的工具。Petri网已经被证明是离散事件或异步系统很好的建模和分析工具,混合随机Petri网是Petri网的一个扩展,具有强大的建模功能。仿真结果表明,所建立的模型是正确的。     

神光III控制系统的故障建模与分析

应用混合随机Petri网对神光III控制系统的故障进行了建模,并应用Visobj Net对建立的故障模型进行了仿真分析。网络化控制系统是一个离散和连续相结合的混合动态系统,具有动态、并发及同步等特征;神光III控制系统就是网络化控制技术在武器装备上的一个典型应用;对于复杂系统的建模和分析,Petri网是一个非常有效的工具。Petri网已经被证明是离散事件或异步系统很好的建模和分析工具,混合随机Petri网是Petri网的一个扩展,具有强大的建模功能。仿真结果表明,所建立的模型是正确的。     

非马尔可夫随机Petri网模型的混合状态分析法

讨论具有发射时间任意分布之变迁的随机Petri网的解析问题.定义了随机Petri网 的混合状态和混合状态密度,提出混合状态分析法,并给出具有一步转移关系标识下的混合状 态密度的递推公式.使非马尔可夫型随机Petri网的分析成为可能.通过算例说明了混合状 态分析法在系统性能评估中的应用.     

随机Petri网可视化软件的设计与实现

针对随机Petri网建模设计与分析的复杂性问题,通过面向对象方法在VisualC++环境下利用MFC开发了可视化的随机Petri网建模和分析工具SPNSim。利用广度优先思想,设计了可达图的生成算法,给出了随机Petri网模型的编辑器,用户可以直观方便地进行随机Petri网编辑,同时还能进行模型分析,得到可达图、稳态概率等随机Petri网特性和系统性能指标。通过对一个实例的建模与分析,结果验证了软件工具SPNSim的正确性和可用性。     

基于随机Petri网的协同服务模型与分析

提出了一种基于随机Petri网的协同服务模型与分析方法,选择了企业协同服务中几个最具有代表性的流程,利用随机Petri对这些代表流程进行了建模以及模型简化和证明.然后,以电子商务系统中的物流系统为例,在随机Petri网模型建模的基础上应用模型等价化简和性能评价方法,时模型化简前后的系统性能和计算时间进行了对比分析.     

Petri网合成理论及应用综述

对于建模和分析物理系统的模型,Petri网在处理并发和冲突方面具有强大的能力.Petri网合成技术将小型Petri网通过一组子网的某些共享位置、某些共享变迁按合成规则综合成复杂网系统,它足Petri网系统建模中一种重要的自底向上的建模方法,适用于具有异步、并发特征的复杂应用环境.综述了 Petri网系统两种合成操作(共享合成、同步合成)理论,然后介绍了国内外研究状况,最后指出了合成技术在柔性制造系统(FMS)和多媒体系统等应用方面的发展热点.     

基于Petri网的物流仓储系统的建模研究

Petri网作为一种离散事件动态系统的建模和分析方法,提供了在逻辑时序下研究系统特性和性能的有效手段,并有图形方法的直观性和逻辑方法的概括性.运用Petri网建立入库子模型及出库子模型,并使用基本Petri网和随机Petri网的化简规则对相应模型进行化简继而分析,得出优化结论,从而实现物流仓储系统的建模研究.     

基于Gillespie算法的生化随机Petri网演化分析

Petri网既有严格的数学表达方式,又有直观的图形描述形式,是当前生物化学系统模拟和定性分析的一个有力工具。作为标准Petri网的一个重要扩展,随机Petri网使得可以定量地分析生物化学系统。建立了两个典型的生物化学系统的随机Petri网模型：Schlogl系统和转录调控系统,并使用Gillespie随机仿真算法模拟了这些生化随机Petri网模型的状态演化。     

立体轨道式码头传送系统建模与仿真

针对集装箱码头立体轨道式传送系统网络的复杂结构,采用面向对象随机Petri网（Object-Oriented Stochastic Petri Net,OOSPN）建模方法,简化结构实现层次化建模,并运用随机Petri网进行性能分析。从而检测出系统各个特征状态的执行效率,有效地发现了系统瓶颈,并提出了改进方案。在此基础上,通过WITNESS仿真软件实现码头作业的模拟。结果表明该方法能有效构建和分析集装箱码头立体轨道式传送系统网络复杂系统,并获得其效率指标和统计数据。     

Performance analysis of stochastic timed Petri nets using linearprogramming approach

Stochastic timed Petri nets are a useful tool in the performance analysis of concurrent systems such as parallel computers, communication networks and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are difficult to obtain for practical problems due to their sizes. In this paper, we provide a method to efficiently compute upper and lower bounds for the throughputs and mean token numbers for a large class of stochastic timed Petri nets. Our approach is based on uniformization technique and linear programming     

基于随机Petri网的性能与可靠性评价

近年来,随机Petri网在柔性制造系统、计算机及通信系统等领域的性能与可靠性评价中得到了广泛的应用。文章首先介绍了性能与可靠性评价,然后回顾了广义随机Petri网及其状态空间爆炸问题,最后讨论了非马尔科夫随机Petri网。     

基于行为表达式的任意随机Petri网的品质分析

提出一种基于行为表达式的品质分析方法,可以做任意分布的有界或无界随机 Petri网的品质分析.该方法不仅拓广了分析范围,解决了文献[4]中没有解决的问题,而且 不必画出Petri网的可达标识图,使分析过程更为简洁.     

基于随机Petri网模型的网络协议性能测试

分析了协议性能测试需要解决的主要问题,并以随机Petri网为形式化工具,描述了网络协议的服务质量.提出从随机Petri网模型到TTCN(tree and tabular combined notation)测试集的转换规则,并根据随机Petri网模型生成了协议性能测试例.     

Performance evaluation of real-time decision-making architectures for computer-integrated manufacturing systems

A general method is proposed for the performance evaluation of a decision-making architecture for computer-integrated manufacturing systems. A decision-making architecture broadens the concept of a control architecture by integrating control, communication and database functions. A modular modeling methodology is developed that captures these features and is applicable to an arbitrary computer-integrated manufacturing architecture. The model is based on generalized stochastic Petri nets and leads to a quantitative evaluation of such performance measures as response time, average utilization of a particular system component, average queue length, etc. The net result is a design tool that can be used to make tradeoffs among the system parameters.

The proposed technique is demonstrated using several real-time decision-making architectures. Several general conclusions are drawn from this investigation. Finally, a Petri net model reduction method is presented for this problem and used to compare the original performance evaluation results with those obtained from the simplified models.     

New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets

Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In this paper we prove that the minimal cycle time problem, for non-P-invariant Petri nets and for a small subclass of P-invariant Petri nets called free-choice nets having live and safe marking, is NP-complete.     

Modeling and performance evaluation of supply chains using batch deterministic and stochastic Petri nets

Batch deterministic and stochastic Petri nets are introduced as a tool for modeling and performance evaluation of supply chains. The new model is developed by enhancing deterministic and stochastic Petri nets (DSPNs) with batch places and batch tokens. By incorporating stochastic Petri nets (SPNs) with the batch features, inhibitor arcs, and marking-dependent weights, operational policies of supply chains such as inventory policies can be easily described in the model. Methods for structural and performance analysis of the model are developed by extending existing ones for DSPNs. As applications, an inventory system and an industrial supply chain are modeled and their performances are evaluated analytically and by simulation, respectively, using this BSPN model. The applications demonstrate that our model and associated methods can solve some important supply chain modeling and analysis issues. Note to Practitioners-This paper was motivated by the problem of performance analysis and optimization of supply chains but it also applies to other discrete event systems where materials are processed in finite discrete quantities (batches) and operations are performed in a batch way because of batch inputs and/or in order to take advantages of the economies of scale. Existing Petri net modeling and analysis tools for such systems ignore their batch features, making their modeling complicated. This paper suggests a new model called batch deterministic and stochastic Petri nets (BDSPNs) by enhancing deterministic and stochastic Petri nets with batch places and batch tokens. Methods for structural and performance analysis of the model are developed. We then show how an inventory system and a real-life supply chain can be modeled and their performances can be evaluated analytically and by simulation respectively based on the model. The model and associated analysis methods therefore provide a promising tool for modeling and performance evaluation of supply chains.     

基于随机对象Petri网的柔性制造系统性能分析

为了增强传统对象Petri网的定量分析能力,提出随机对象Petri网模型。该模型具备随机性和层次特性,获得与随机Petri网的等价关系,从宏观和微观2个层面对系统进行性能分析,并将该模型应用到柔性制造系统中。实验结果表明,该系统保留了面向对象的建模能力,具有较强的定量分析能力。     

随机Petri网理论在GSM-R通信系统中的仿真应用

列车和无线闭塞中心在多数情况下通信处于正常状态,但在实际通信过程中可能出现以下几种引发故障因素：传输数据出错、连接丢失、越区切换、端到端传输延时。应用仿真主要考虑高速列车在移动闭塞区间条件下GSM-R无线通信系统的可靠性,结合随机Petri网理论对GSM-R铁路无线通信系统故障恢复事件进行建模和分析,给出了随机Petri网表示的列车与无线闭塞中心通信的故障恢复模型,并采用TimeNET仿真工具对GSM-R通信系统的可靠性进行分析得出相应结论。     

A characterization of the stochastic process underlying astochastic Petri net

Stochastic Petri nets (SPN's) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPN's), deterministic and stochastic Petri nets (DSPN's), semi-Markovian stochastic Petri nets (SM-SPN's), timed Petri nets (TPN's), and generalized timed Petri nets (GTPN's) are particular entries in our hierarchy. Additional classes of SPN's for which we show how to compute an analytical solution are obtained by the method of the embedded Markov chain (DSPN's are just one example in this class) and state discretization, which we apply not only to the continuous-time case (PH-type distributions), but also to the discrete case