Petri网在计算机网络实时性分析中的应用

计算机网络实时性分析问题一直是国内外各知名院校、研究机构的研究重点之一。Petri网是一种可以描述系统动态行为特性的图形化建模工具,直观形象,易于学习和理解,便于使用。为此,在给出Petri网基本介绍的基础上,探讨了Petri网在计算机网络实时性分析中的应用价值。     

网络管理中事件关联检测机制的研究

网络事件的关联检测是网络管理需要解决的一个关键问题,本文根据分布式网络管理的特点,首次明确定义了网络事件的基本关联关系,在此基础上提出了一种基于Petri Net的事件关联检测机制,实现了基于事件内容的细粒度关联检测,并且在事件检测中充分考虑了时间因素,有效地提高了事件关联检测的准确性。     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

局域网服务器缓冲区容量的Petri网设计方法

本文在分析局域网服务器信息缓冲区、数据包接受和发送缓冲区的相互关系基础上提出一种新的局域网服务器缓冲区设计方法─—广义随机Ｐｅｔｒｉ网方法，并给出了局域网服务器信息缓冲区的广义随机Ｐｅｔｒｉ网模型。该设计方法理论完备、严谨实用，且不再局限于追求某一边界值（上限或下限），并且避免了排队理论处理多级服务的繁琐公式。最后本文用一例题说明了这种方法的应用。     

一类可由基本模型嵌套组成的工作流系统的性能分析方法

工作流是近年来网络领域里研究的一个热点,对工作流模型的性能分析是工作流研究的一个重要内容.实际的模型往往规模大而复杂,这为分析其性能带来了很大的困难.但有一类模型可由工作流的四种基本模型(顺序、并行、选择、循环)嵌套组成,对于这类模型,本文给出了计算其性能乘积解的数学公式.文中给出了如何由这四种基本模型嵌套组成实际模型的方法,推导出了计算这四种基本模型的性能等价公式,并按建立实际模型相反的顺序,用由里到外逐层的分析方法,给出了计算实际模型的性能乘积解.     

CIMS软件开发工具：Petri网编辑器的语法分析及其实现

本文给出并发表达式语言的文法，并描述了Petri网编辑器的语法分析过程和中间代码的产生过程。解决了Petri网在计算机中的存贮结构问题，处理了可能会出现的重名变量，实现了从井发表达式语言到安全标号的Petri网的转换工作。     

Arsenidostannate mit Arsen-analogen [SnAs]-Schichten: Darstellung und Struktur von Na[Sn2As2], Na0,3Ca0,7[Sn2As2], Na0,6Sr0,6[Sn2As2], Na0,6Ba0,4[Sn2As2] und K0,3Sr0,7[Sn2As2]

Arsenidostannates with [SnAs] Nets Isostructural to Grey Arsenic: Synthesis and Crystal Structure of Na[Sn₂As₂], Na_0.3Ca_0.7[Sn₂As₂], Na_0.4Sr_0.6[Sn₂As₂], Na_0.6Ba_0.4[Sn₂As₂], and K_0.3Sr_0.7[Sn₂As₂] The metallic lustrous compounds Na[Sn₂As₂], Na_0.3Ca_0.7[Sn₂As₂], Na_0.4Sr_0.6[Sn₂As₂], Na_0.6Ba_0.4[Sn₂As₂] and K_0.3Sr_0.7[Sn₂As₂] were prepared from melts of mixtures of the elements. The compounds crystallize in the trigonal system (space group R3 m, No. 166, Z = 3) with lattice constants see in “Inhaltsübersicht”. The structures are isotypic to Sr[Sn₂As₂] containing puckered [SnAs] nets which are stacked with a sequence of six layers. The E(I)/E(II) atoms are located between each second [SnAs] layer in trigonal antiprismatic interstices formed by As atoms. In the resulting [Sn₂As₂] double layers the _∞²[SnAs] nets are stacked in such a way that additional Sn—Sn contacts arise.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Analytical modeling of Transmission Control Protocol NewReno using Generalized Stochastic Petri Nets

This paper presents a novel analytical model of Transmission Control Protocol (TCP) using a generalized stochastic Petri net (GSPN). Extensive simulation work has been done for the performance evaluation of TCP NewReno protocol. In view of the limitations of the simulation technique, we present an analytical approach using GSPN. A GSPN is a useful mathematical tool that solves continuous time Markov chains for complex systems and evaluates the stationary behavior. In this paper, we analyze the slow‐but‐steady variant of TCP NewReno. The model captures the behavioral aspects of the slow start and the congestion avoidance phase together with the fast retransmit and recovery capabilities of TCP NewReno. Performance metrics such as throughput, goodput, and task completion time of the system are obtained. The effect of variation in the model parameters on the performance is studied. The results are validated using the network simulator, and their accuracy is verified by evaluating the confidence interval. The performance of the proposed model is compared with that of TCP Reno. The performance of the proposed model is also compared with one of the previous models. The numerical illustrations and comparison of the proposed technique with simulation validates the accuracy, efficiency, and competence of the GSPN technique. While GSPN modeling for TCP is investigated in depth for the TCP NewReno and TCP Reno variant in this paper, other protocols could be also analyzed similarly. Copyright © 2013 John Wiley & Sons, Ltd.