一种面向对象模糊Petri网建模方法的研究*

针对一些复杂知识系统的知识不确定性及知识规则数量多的特点,在模糊Petri网（FPN）的基础上给出了面向对象模糊Petri网（object-oriented fuzzy Petri net, OOFPN）的形式化定义及其知识表示和知识推理。通过面向对象技术,可以采用模块化方法设计知识系统,将复杂知识系统划分为许多功能子系统,从而降低构建知识系统的复杂性,方便知识系统的优化和管理。     

Supervisory control of a multi-echelon supply chain: A modular Petri net approach for inter-organizational control

Petri nets (PNs) are frequently utilized to model system dynamics due to their ability to handle concurrencies and sequential dependence. In this paper, a portion of the supply chain operations reference (SCOR) model has been extracted and modeled using PNs for the purpose of exerting supervisory control upon a multi-echelon supply chain (SC). The activities of source, make and deliver, inherent in the SCOR model form the basis of the representation of the PN model for each echelon considered in the SC model. Two control nets are utilized: one above the base model of each echelon to exert local constraints and an enterprise level supply chain manager (SCM). The local constraints are at the tactical and operational levels while the SCM enforces additional constraints consisting of long term planning goals at the strategic level. Place invariants are used to create the supervisors. Performance measures of the total SC are formulated to determine the effectiveness of any partnership. An efficient method for finding the current state of the system is developed which is used to determine the performance measures of each echelon. This paper presents a modular approach to the overall structure and PN modeling for a SC system. It is intended to extend the use of supervisory control from a shop-floor level to an inter-organizational facility and enterprise level.     

面向对象Petri网继承性的研究

面向对象Petri网(OOPN)利用面向对象的封装性解决了Petri网不能用于大型系统建模的问题.针对大型系统建模中的面向对象Petri网建模的便捷性进行研究,将面向对象的继承性以及与之紧密联系的多态性引入到OOPN中,以其在更大程度上实现模型的复用,使大型系统建模过程更加便捷、灵活.     

生化网络的随机Petri网建模与分析

细胞的行为是随机性的,学习细胞中的随机性有助于理解细胞的组织,设计和进化。建立、确认和分析随机的生化网络模型是当前计算系统生物学领域的一个重要研究主题。当前,标准的Petri网模型已经成为生化网络模拟和定性分析的有力工具。尝试使用随机Petri网对生化网络进行建模与分析,简单描述了随机Petri网理论对标准Petri网的扩充,通过对二聚作用和肌动蛋白这两个典型例子的建模与演化模拟,介绍、论证了随机Petri网理论的新应用。     

Performance analysis using Petri nets

The purpose of this paper is to focus on the implementation issues associated with using Petri nets for the performance analysis of discrete event dynamic systems while demonstrating several applications in manufacturing systems. Practical modeling issues will be discussed and several applications will be presented that illustrate the advantages and limitations of this methodology. These issues lead to the definition of several research problems in Petri nets for performance analysis.     

Software modeling and analysis using a hierarchical object-oriented Petri net

Petri net is used widely to analyze and model various systems formally. Recently, many Petri nets mania devote their efforts to enhancing and extending the expressive power of Petri nets. One such effort is to extend Petri nets with object-oriented concepts. An object-oriented paradigm provides excellent concepts to model real-world problems. Object-oriented concepts allow us to build software systems easily, intuitively, and naturally. Although several high-level Petri nets with the concept of objects are suggested, these nets do not fully support the object-oriented concepts. In this paper, we propose a hierarchical object-oriented Petri net (HOONet). The formal syntax and semantics of HOONet are explained in detail. HOONet supports a wide range of object-oriented features including abstract, encapsulated and modularized objects, object interaction by message passing, inheritance, and ploymorphism. HOONet also supports a variety of modeling and analysis mechanisms such as incremental modeling of evolving systems, unfolding the HOONet to lower level Petri net, and incremental reachability analysis for HOONet models. We demonstrate the usefulness of HOONet by applying it to modeling and analysis with an example.     

Process vs resource‐oriented Petri net modeling of automated manufacturing systems

Since the 1980s, Petri nets (PN) have been widely used to model automated manufacturing systems (AMS) for analysis, performance evaluation, simulation, and control. They are mostly based on process‐oriented modeling methods and thus termed as process‐oriented PN (POPN) in this paper. The recent study of deadlock avoidance problems in AMS led to another type of PN called resource‐oriented PN (ROPN). This paper, for the first time, compares these two modeling methods and resultant models in terms of modeling power, model complexity for analysis and control, and some critical properties. POPN models the part production processes straightforwardly, while ROPN is more compact and effective for deadlock resolution. The relations between these two models are investigated. Several examples are used to illustrate them. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于Petri网的服装供应链仿真模型

为获得服装供应链运行决策的最佳方案,提高服装产品的快速响应能力,采用面向对象Petri网技术构建了基于节点响应时间的服装供应链动态仿真模型,并运用Flexsim软件,对一个五级服装供应链仿真模型进行了仿真计算。仿真结果发现,市场需求的不确定对该服装供应链运作效率有较大的影响;当需求量变小时,通过减少供应链生成节点的设备使用数量可以提高供应链运作效率;当需求量变大时,提高设备和人员的工作效率比增加设备数量更能提高供应链的运作效率;供应链节点企业间只有相互协作,才能使供应链运作效率达到最优,实现服装产品对市场需求的快速响应。该仿真模型为服装企业制定有效的产品生产计划,以及提高快速反应能力提供了定量的参考依据。     

Discrete event diagnosis using labeled Petri nets. An application to manufacturing systems

In this paper an approach to on-line diagnosis of discrete event systems based on labeled Petri nets is presented. The approach is based on the notion of basis markings and justifications and it can be applied both to bounded and unbounded Petri nets whose unobservable subnet is acyclic. Moreover it is shown that, in the case of bounded Petri nets, the most burdensome part of the procedure may be moved off-line, computing a particular graph called Basis Reachability Graph.Finally, the effectiveness of the proposed procedure is analyzed applying a MATLAB diagnosis toolbox we developed to a manufacturing example taken from the literature.     

Verification of bounded Petri nets using integer programming

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings—themselves a class of acyclic Petri nets—which contain enough information, albeit implicit, to reason about the reachable markings of the original Petri nets. In [19], a verification technique for net unfoldings was proposed, in which deadlock detection was reduced to a mixed integer linear programming problem. In this paper, we present a further development of this approach. The essence of the proposed modifications is to transfer the information about causality and conflicts between the events involved in an unfolding, into a relationship between the corresponding integer variables in the system of linear constraints. Moreover, we present some problem-specific optimisation rules, reducing the search space. To solve other verification problems, such as mutual exclusion or marking reachability and coverability, we adopt Contejean and Devie's algorithm for solving systems of linear constraints over the natural numbers domain and refine it, by taking advantage of the specific properties of systems of linear constraints to be solved. Another contribution of this paper is a method of re-formulating some problems specified in terms of Petri nets as problems defined for their unfoldings. Using this method, we obtain a memory efficient translation of a deadlock detection problem for a safe Petri net into an LP problem. We also propose an on-the-fly deadlock detection method. Experimental results demonstrate that the resulting algorithms can achieve significant speedups.

基于精炼操作的Petri网建模及其分析方法

针对复杂系统的Petri网建模及其分析问题,定义了Petri网的精炼操作及其相关的Petri网模型.基于序列投影,建立精炼Petri网与原网、子网间的动态行为关联关系,并分析了该精炼操作的相关动态性质,得到一组性质保持判据.最后,基于该方法实现了一个顺序资源共享系统的应用案例的建模及其分析.所提出的方法不仅为复杂系统的Petri建模提供了新的思路,而且有助于复杂Petri网模型的分析和验证.     

Colored timed Petri nets for modeling and analysis of cluser tools

In this paper, a colored timed resource‐oriented Petri net (CTROPN) is developed to model the cluster tools in semiconductor fabrication. It is structurally simple and concise, since each module in a cluster tool corresponds to a unique place in CTROPN. It is also powerful in modeling the qualitative and temporal behavior of the cluster tools with a single‐blade or dual‐blade robot. The initial transient behavior, steady‐state behavior and the final transient behavior can all be investigated through a single model. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

代谢网络结构与功能的Petri网分析

发展基因组尺度代谢网络模型的模拟和分析方法有助于学习这些网络的结构与功能关系,是当前计算系统生物学领域的一个重要研究主题。由于具备严格的数学描述,直观的图形表达,外加存在众多的算法和工具,Petri网可能成为代谢网络模拟和分析的有力工具。应用位置/变迁网来分析代谢网络的结构与功能特征,首先建立了巴斯德毕赤酵母代谢的Petri网模型,随后计算了该模型中的P、T不变量,并讨论了它们的生物学意义。     

应急预案流程的Petri网建模方法研究

为了提高应急信息系统模型的语义基础,提出了一种基于Petri网的应急预案流程的建模方法。以ABC模型为上位本体建立了应急预案流程本体,提出了应急预案流程的Petri网建模过程,并定义了应急预案流程中本体和层次Petri网的映射规则。使用该方法对某公路桥梁抢修应急预案流程进行Petri网建模,并通过仿真分析验证了建模方法的有效性。     

Prediction of business process durations using non-Markovian stochastic Petri nets

Companies need to efficiently manage their business processes to deliver products and services in time. Therefore, they monitor the progress of individual cases to be able to timely detect undesired deviations and to react accordingly. For example, companies can decide to speed up process execution by raising alerts or by using additional resources, which increases the chance that a certain deadline or service level agreement can be met. Central to such process control is accurate prediction of the remaining time of a case and the estimation of the risk of missing a deadline.To achieve this goal, we use a specific kind of stochastic Petri nets that can capture arbitrary duration distributions. Thereby, we are able to achieve higher prediction accuracy than related approaches. Further, we evaluate the approach in comparison to state of the art approaches and show the potential of exploiting a so far untapped source of information: the elapsed time since the last observed event. Real-world case studies in the financial and logistics domain serve to illustrate and evaluate the approach presented.     

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

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

A two phase optimization method for Petri net models of manufacturing systems

Optimization is a key issue in the design of large manufacturing systems. An adequate modeling formalism to express the intricate interleaving of competition and cooperation relationships is needed first. Moreover, robust and efficient optimization techniques are necessary. This paper presents an integrated tool for the automated optimization of DEDS, with application to manufacturing systems. After a very quick overview of optimization problems in manufacturing systems, it presents the integration of two existing tools for the modeling and evaluation with Petri nets and a general-purpose optimization package based on simulated annealing. The consideration of a cache and a two phase technique for optimization allows to speed-up the optimization by a factor of about 35. During the first preoptimization phase, a rough approximation of the optimal parameter set is computed based on performance bounds. Two application examples show the benefits of the proposed technique.     

装配可靠性的模糊广义随机Petri网建模与分析

针对一般广义随机Petri网模型精度低的问题,将模糊数引入到广义随机Petri网,提出模糊广义随机Petri网的概念.结合模糊数包含信息多的优点,利用模糊广义随机Petri网对装配过程进行建模,通过同构的Markov链对模型进行定量分析.用模糊广义随机Petri网模型计算得到的装配可靠度与一般广义随机Petri网模型的装配可靠度进行分析比较,结果表明了模糊广义随机Petri网模型的精度更高.以数控磨床砂轮架为例,证明了上述方法的有效性.     

广义随机Petri网在生态产业园区性能分析中的应用*

为了对生态产业园区规划方案进行定量描述和评价,利用基于广义随机Petri网的建模分析方法,根据广义随机Petri网模型与马尔可夫链的同构关系,得到生态产业园区的Petri网模型和马尔可夫链模型。并通过马尔可夫链理论与相关数学方法,得到生态产业园区规划方案的吞吐性能、时间性能以及关键资源利用率和重点加工环节运作效率等性能指标,诊断出现有规划中存在的问题,为生态产业园区规划方案的评价和改进提供了一个思路。     

Symbolic execution of concurrent systems using Petri nets

Techniques for analyzing sequential programs in order to improve their reliability have been widely studied in the past. Among the most interesting analysis techniques, we consider symbolic execution. However, analysis techniques for concurrent programs, and in particular symbolic execution, are still an open research area. In this paper, we define a method for symbolic execution of concurrent systems, based on an extension of the Petri net formalism, called EF nets. EF nets are a powerful, highly expressive and general formalism. Depending on the level of abstraction of actions and predicates that one associates to the transitions of the net, EF nets can be used as a high-level specification formalism for concurrent systems, or as a lower level internal representation of concurrent programs. Thus, the model is not dependent on a particular concurrent programming language, but it is flexible enough to be the kernel model for the representation of a wide set of systems and programming languages. In the paper, in order to support the analysis of a concurrent system or program, at first a general algorithm for symbolically executing an EF net is defined. Then, a more efficient algorithm is given for the particular, though important, subclass of EF nets, defined as safe EF nets. Such algorithm is proved to significantly help in reducing the amount of information needed to characterize a symbolic execution. Both the modelling power of the EF nets and the usefulness of the concurrent symbolic execution algorithms defined are illustrated by means of a case study.