Petri网展开图法的分析和应用

Petri网的展开图是一种特殊的并发系统状态空间搜索方法，它不需要重复考虑并发事件的所有可能的交集，从而大大缩减状态空间爆炸给验证分析带来的空间复杂度和时间复杂度。使用展开图分析Petri网的行为属性与传统的Petri网分析方法相比，具有自己的特点。该文首先介绍了Petri网展开图的构造算法，在此基础上使用展开图分析方法对一个典型Petri网的活性，有界性和可逆性等行为属性进行了分析，并与传统的Petri网分析方法作比较。     

Modeling Multithreaded Applications Using Petri Nets

Since most modern computing systems contain multiple processing elements, applications are relying on multithreaded programming techniques that allow a program to execute multiple tasks concurrently to take advantage of the processing capabilities. Multithreaded programs are more difficult to design and test because of the nondeterministic execution orders and synchronization among the threads. Different approaches can be used to test Multithreaded Applications. In our approach we use Petri nets to represent the key elements of interactions among threads to identify potential problems such as race conditions, lost signals, and deadlocks. A tool called C2Petri has been developed which converts C-Pthreads programs to the equivalent Petri net model. This tool helps verification of Pthread-based programs. At present the tool has limited capabilities and we hope to expand the capabilities of our tool in the near future.     

基于Petri网工作流的动态访问控制

访问控制是信息系统的一项重要安全保护机制,它是通过限制主体对资源的访问权限,从而保证资源的可用性、完整性和可信性的机制。此种机制通过访问控制矩阵实现,但现在的访问控制矩阵是静态的,它们不随时间的变化而改变。文中通过访问控制矩阵和基于Petri网的工作流结合提出了动态访问控制。访问权限是根据工作流的状态来赋予的,这样减少了对资源和数据的误操作,提高了系统访问的安全性和适时性。文中的工作流模型采用Petri网来描述,Petri网具有坚实的数学分析基础,很适合于表述工作流这样的离散模型。     

有色Petri网的一种面向对象扩展形式

Ｐｅｔｒｉ网与面向对象的结合一直是一个令人感兴趣的研究课题。本文把有色Ｐｅｔｒｉ网引入到面向对象方法中,提出了一种面向对象的扩展有色Ｐｅｔｒｉ网,简称为ＯＥＣＰＮ,     

Control Synthesis of Petri Nets Based on S-Decreases

A method for constructing a controller for a discrete event system modeled by a Petri net is presented in this paper. The control specification of the system is given by a set of linear inequality constraints defined on the marking of the net. The controller that forces the net to obey the constraints is an extended Petri net, which is synthesized based on minimal support S-decreases. The method can deal with general Petri nets with uncontrollable transitions, and then provides a systematic way for synthesizing net-based controllers for discrete event systems.     

Off-Line Computation of Real-Time Schedules Using Petri Nets

We present a methodology of off-line analysis of real-time systems, composed of periodic, synchronous or asynchronous precedence and resource constrained real-time tasks. As there is no polynomial optimal scheduling technique for such tasks sets, we present an enumerative method based on the construction of the state graph of a Petri net. The time is modeled by the Petri net through the earliest firing rule.     

对象化模糊Petri网的任务协同分配建模与推理

为解决FPNN/FCPN建模与推理过程中存在模型规模急剧增大、模糊变量颜色化的作用有限、无法表示知识分类等问题,提出了一种改进的对象化模糊Petri网（FPN）建模及模糊推理算法.该算法采用面向对象技术化简规模庞大的模糊赋色Petri网（FCPN）,经简化的FCPN退化为普通的FPN,但是库所中托肯的语义也发生了变化,它不仅表示模糊语言变量的集合,更重要的是它可作为其他FCPN的引用.最后将该算法应用于协同设计环境中任务分配的模糊推理过程,可有效地降低Petri网模型的复杂程度,且对象化FPN模型直观,易于理解.     

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

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

An Improvement of McMillan's Unfolding Algorithm

McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the worst case). We present a refinement of the algorithm which overcomes this problem.     

Tutorial and Survey Articles: An introduction to Petri Nets

This paper describes the fundamental concepts and characteristics of Petri nets (PNs) that make them a significant tool for modeling and analyzing asynchronous systems with concurrent and parallel activities and follows the extensions that improved the implementation capabilities of the original PNs.

Their first and most relevant extension was time modeling, a vital aspect of system performances not considered in the original version. There are several possibilities for introducing time in PNs. Among them, a technique that associates time with places is presented in some detail. As PNs tend to become cumbersome and time consuming when large and complex systems are involved, a method for decomposing timed PNs of open queuing networks is reviewed here.

Though initially developed as an information/computer-based technique, PNs were immediately adopted in a variety of application areas, such as manufacturing, design, planning and control. Viewed through a more recently developed programming perspective, the ordinary PNs became “high level” PNs suitable for defining different data types and for applying hierarchical approaches.

It is expected that the robust theoretical basis of this tool coupled with its visual and flexibility features will continue to appeal to researchers and practitioners alike in a variety of domains and as a result will continue to evolve and expand.     

不可否认协议的Petri网建模与分析

Petri网是一种描述及分析并发行为的工具,在安全协议的形式化分析中得到了广泛的应用．作为一种特殊的安全协议,不可否认协议虽然已得到了多种形式化方法的分析,但还没有人使用Petri网来分析它们．以一般安全协议的Petri网分析方法为基础,提出了使用Petri网分析不可否认协议的建模及分析方法,该方法可以描述并分析一些其他形式化方法无法描述的协议性质．使用该方法分析Zhou和Gollmann于1996年提出的一个公平不可否认协议,可以发现该协议的一个许多其他形式化方法不能发现的已知缺陷．     

On Hybrid Petri Nets

Petrinets (PNs) are widely used to model discrete event dynamic systems(computer systems, manufacturing systems, communication systems,etc). Continuous Petri nets (in which the markings are real numbersand the transition firings are continuous) were defined morerecently; such a PN may model a continuous system or approximatea discrete system. A hybrid Petri net can be obtained if onepart is discrete and another part is continuous. This paper isbasically a survey of the work of the authors' team on hybridPNs (definition, properties, modeling). In addition, it containsnew material such as the definition of extended hybrid PNs andseveral applications, explanations and comments about the timingsin Petri nets, more on the conflict resolution in hybrid PNs,and connection between hybrid PNs and hybrid automata. The paperis illustrated by many examples.     

Petri网的一类禁止状态问题的混合型监控器算法设计

针对广义互斥约束下Petri网的不可控影响子网为状态机的一类禁止状态问题,给出了观测器的设计方法,并基于观测器得到了求解最大允许控制策略的算法.利用观测器将广义互斥约束简化为单禁止库所约束,并将存在不可控变迁的问题简化为相当于变迁全部可控的问题,这有效地解决了不可控变迁带来的计算复杂性问题.最后,利用一个地铁交通调度示例验证和说明该监控器设计方法.     

多主体行为模拟的层次Petri网方法

对多主体系统中主体行为间关系进行准确的描述和分析是保证多主体系统顺利运行的关键因素之一。与已有的基于Petri网的方法不同,该文将主体的动作分类为内部和外部动作,利用Petri网系统描述单个主体的内部结构,进而得到多主体系统的层次Petri网系统模型,每个主体的内部结构在系统网系统中表现为一个替代变迁元素,如此可以从两个层次（系统层和主体层）上对多主体系统的各种动态行为间的关系,特别是并发关系进行描述和分析。     

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

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

晶圆制造单元的Petri网建模和性能分析

晶圆制造是半导体制造过程中的一个重要环节,晶圆制造单元的性能直接影响晶圆制造的成本。为了有效地分析晶圆制造单元的动态性能,分别对加工设备存在瓶颈和搬运机器人存在瓶颈的两种情况,进行了赋时Petri网建模研究,建立了晶圆制造单元的赋时Petri网模型。在此基础上,进行了稳态生产率分析,同时用实例验证了模型的有效性和实用性。     

正规表达式与恰当终结的标准Petri网

给出了一种较特殊的Petri网子类——恰当终结的标准Petri网,可以证明恰当终结的标准Petri网产生的语言是正规语言,反之任一正规语言都可由恰当终结的标准Petri网产生。研究了恰当终结的标准Petri网语言关于连接运算“ ”、选择(并)运算“∪”、kleene闭包运算“*”、并行运算“//”的性质,给出了用恰当终结的标准Petri网(带空标注)模拟和带并发算子的正规表达式的方法。     

Performance Analysis of Retrial Queueing Systems Using Generalized Stochastic Petri Nets

We consider retrial queueing systems, in which an arriving customer finding the server busy, may repeat his call after a random duration. The consideration of repeated calls introduces great analytical difficulties. In fact, detailed analytical results exist for some special retrial queueing systems, while for many others, the performance evaluation is limited to numerical algorithms, approximation methods and simulation. Retrial queues have been widely used to model many problems in telephone switching systems, telecommunication and computer networks. In this paper, we show a method of modelling and analysing retrial queueing systems, using the Generalized Stochastic Petri nets (GSPNs).     

Transformations of Petri Nets

The aim of this paper is an introduction to the area of Petri net transformations, a rule-based approach for dynamic changes of the net structure of Petri nets. This is especially important for the stepwise construction of Petri nets in the sense of the software development process in software engineering. The concept of Petri net transformations is based on that of graph transformations and high-level replacement systems and it is introduced within a small case study logistics.