Fuzzy Petri nets with neural networks to model products qualityfrom a CNC-milling machining centre

This paper presents a Petri net approach for the modeling of a CNC-milling machining centre. Next, by utilizing fuzzy logic with Petri nets (fuzzy Petri nets), a technique based on 9 fuzzy rules is developed. This paper demonstrates how fuzzy input variables, fuzzy marking, fuzzy firing sequences, and a global output variable should be defined for use with fuzzy Petri nets. The technique employs two fuzzy input variables (spindle speed and feed rate), throughout the milling operation in order to determine surface roughness. Additionally, a fuzzy Petri net is used with an artificial neural network for the modeling and control of surface roughness. Experimental results illustrate that the technique developed can be of benefit when the cutting tool has suffered damage throughout the milling operation. It also shows how the technique can react when the quality is high, medium, or low. The surface roughness represents the quality specification of products from the CNC-milling machining centre     

模糊时间Petri网及其时间推理方法

Petri网是一种用网状图形表示系统模型的方法,它能够从组织结构、控制和管理的角度,精确描述系统中事件(变迁)之间的依赖(顺序)和不依赖(并发)关系。但传统的Petri网理论其不足之处在于:它的分析方法主要是可达树分析法和线性代数描述法。可达树分析法是针对某一个初始标识的,一个新的初始标识就意味着需要重新构造可达状态图;当系统存在较多     

基于模糊神经Petri网的故障诊断模型

Petri网是对具有产生式规则的故障诊断系统的有力建模工具，但其缺乏较强的学习能力．本文以Petri网的基本定义为基础，结合模糊逻辑和Petri网模型，定义了模糊Petri网模型，在此基础上引入人工神经网络技术，给出了人工神经网络的模糊Petri网表示方法，并针对工程机械故障诊断异步、离散等特点，提出并建立了故障诊断的模糊神经Petri网模型及其改进模型．基于模糊神经Petri网的故障诊断系统结合了Petri网和人工神经网络的优点，经过自学习后同时具有很强的推理能力和自适应能力．     

基于CPEBSDL通信协议的Petri网建模方法

结合CPEBSDL描述语言、Petri网可达图、Petri网进程等协议分析方法,提出一种基于通信协议建立Petri网模型的方法——PMA_CPEBSDL。该方法利用CPEBSDL语言描述了通信协议实体的行为,自动地对协议建立Petri模型。协议的进程分析方法和可达图分析方法使协议的测试更加准确、直观。结合一个实例,给出LAPD协议完整的建模过程及协议验证和测试的方法。     

Fuzzy Petri net-based programmable logic controller

Programmable logic controllers (PLCs) are able to directly implement control sequences specified by means of standard languages such as Grafcet or formal models such as Petri nets. In the case of simple regulation problems between two steps it could be of great interest to introduce a notion of “fuzzy events” in order to denote a continuous evolution from one state to another. This could result from a linear interpolation between the commands attached to two control steps represented by two Petri net (PN) places. This paper is an attempt to develop fuzzy PN-based PLCs in a similar way as fuzzy controllers (regulators). Our approach is based on a combination of Petri nets with possibility theory (Petri nets with fuzzy markings)     

模糊时间Petri网的时间推理及其在过程监测中的应用

针对传统分析方法的不足,提出用线性逻辑给出模糊时间Petri网描述和时间推理的方法。该方法能清楚地分析模糊时间Petri网的运行行为,具体例子说明了其在系统过程监测和诊断中的应用。     

Generalized fuzzy Petri nets as pattern classifiers

In this study, we discuss a novel approach to pattern classification using a concept of fuzzy Petri nets. In contrast to the commonly encountered Petri nets with their inherently Boolean character of processing tokens and firing transitions, the proposed generalization involves continuous variables. This extension makes the nets to be fully in rapport with the panoply of the real-world classification problems. The introduced model of the fuzzy Petri net hinges on the logic nature of the operations governing its underlying behavior. The logic-driven effect in these nets becomes especially apparent when we are concerned with the modeling of its transitions and expressing pertinent mechanisms of a continuous rather than an on–off firing phenomenon. An interpretation of fuzzy Petri nets in the setting of pattern classification is provided. This interpretation helps us gain a better insight into the mechanisms of the overall classification process. Input places correspond to the features of the patterns. Transitions build aggregates of the generic features giving rise to their logical summarization. The output places map themselves onto the classes of the patterns while the marking of the places correspond to the class of membership values. Details of the learning algorithm are also provided along with an illustrative numeric experiment.     

基于组合逻辑的故障诊断方法

针对复杂系统故障传播和故障分析的模糊性和不确定性,首先,在逻辑Petri网和模糊Petri网的理论基础上,根据逻辑Petri网的传值不确定性以及模糊Petri网对模糊信息的表示和推理能力的特点,提出模糊逻辑Petri网的概念及推理规则,考虑不同故障源对故障的影响程度,将概率信息引入模糊逻辑Petri网,对故障源赋予置信度,使故障诊断过程更符合实际。其次,利用模糊逻辑Petri网对故障诊断系统进行建模,用模糊逻辑Petri网描述了系统故障状态组合的逻辑关系,并进一步简化了系统模型的表达形式,具有良好的封装性、重构性和可维护性,在一定程度上缓解了状态组合空间爆炸问题。针对故障的传播性,采用可达性分析方法对故障信息的传播路径进行模拟论证,提高了故障诊断效率。最后,通过离心式压缩机故障诊断过程实例分析,验证了该方法的有效性和可行性,提高了故障诊断过程的准确性和高效性。     

基于逻辑电路的Petri网化简方法

已有的Petri网化简方法需将网的局部结构与化简规则作逐一的比对,步骤较为繁琐,并且所提供的方法不适合于带抑止弧的网.采用一种与传统方法不同的化简思路,首先将网划分为若干个最大无圈子网,将每个最大无圈子网表达为若干个逻辑式.用逻辑代数来完成逻辑式的化简,最后将其结果还原为Petri网回嵌到原网中,完成整个网的化简.给出了寻找最大无圈子网、最大无圈子网的化简算法以及相关的证明.该方法将化简范围扩展到了带抑止弧的无回路的网或网的局部.     

遗传神经网络故障诊断自适应Petri网模型

研究故障诊断优化问题。针对传统Petri网难以精确地描述故障现象和故障原因之间的复杂关系,造成故障诊断难以精确,提出了将遗传算法、神经网络和传统Petri网模型结合,形成了一种改进的自适应的加权Petri网模型以及模型的构造算法,同时在此基础上,采用改进的遗传算法对神经网络模型的权值进行优化训练,并给出了采用构造的自适应模糊Petri网模型对故障进行诊断的具体步骤。仿真实例验证了算法的有效性,对柔性制造系统实例的故障进行诊断,验证了此自适应的加权模糊Petri网模型结合了Petri网和遗传算法的优点,具有很强的故障推理能力以及自适应能力,能有效地对故障进行诊断。     

动态模糊Petri网模型及其应用研究

以模糊Petri网的基本定义，动态模糊集和动态模糊逻辑为基础，讨论了动态模糊Petri网的基本模型，建立了动态模糊Petri网与模糊Petri网之间的映射关系和转移算法，解决了与动态模糊知识的动态模糊Petri网表示相关的几个问题，最后给出了动态模糊Petri网中动态模糊性的计算方法和相应的推理方法。     

Petri网模型代码映射研究

为了简化仿真系统的实现过程,分析总结了Petri网到程序代码的映射准则,从Petri网的基本元素和关系入手,根据逻辑关系建立映射的三类原子语句,并通过两种合成方式形成分子语句。以原型Petri网为例,遍历可达标识图的各种分支路径,提出循环路径到循环结构语句的代码映射方法。最后给出了带抑制弧的扩展Petri网和受控Petri网的代码映射方案,为Petri网向程序代码的转换提供了理论依据。     

A generalization of state avoidance policies for controlled Petrinets

This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law     

A model of fuzzy spatio-temporal knowledge representation and reasoning based on high-level Petri nets

In many application areas there is a need to represent human-like knowledge related to spatio-temporal relations among multiple moving objects. This type of knowledge is usually imprecise, vague and fuzzy, while the reasoning about spatio-temporal relations is intuitive. In this paper we present a model of fuzzy spatio-temporal knowledge representation and reasoning based on high-level Petri nets. The model should be suitable for the design of a knowledge base for real-time, multi-agent-based intelligent systems that include expert or user human-like knowledge. The central part of the model is the knowledge representation scheme called FuSpaT, which supports the representation and reasoning for domains that include imprecise and fuzzy spatial, temporal and spatio-temporal relationships. The scheme is based on the high-level Petri nets called Petri nets with fuzzy spatio-temporal tokens (PeNeFuST). The FuSpaT scheme integrates the theory of the PeNeFuST and 117 spatio-temporal relations.The reasoning in the proposed model is a spatio-temporal data-driven process based on the dynamical properties of the scheme, i.e., the execution of the Petri nets with fuzzy spatio-temporal tokens. An illustrative example of the spatio-temporal reasoning for two agents in a simplified robot-soccer scene is given.     

标注Petri网中的最小初始标识估计

为获得制造系统初始化时的最小资源以实现最优资源分配,利用标注Petri网对系统进行建模,并研究标注Petri网的最小初始标识估计问题。给定一个标注Petri网,在不可观测变迁组成无环子网的情况下,基于动态规划提出一种新的最小初始标识估计算法。在观察到给定的标注序列后,放宽不可观测变迁发生个数的限制,并根据该算法构建节点的演化过程。当出现相同的发生数向量时,仅保留当前极小的初始标识估计,并通过节点的演化过程对极小初始标识估计的托肯总数进行对比。为验证算法的有效性,给出一个制造系统的标注Petri网模型实例,最终得到的最小初始标识为［1000］^T,且对应的变迁发生序列为t₁t₃t₄t₆,满足给定标注Petri网的结构要求。实验结果表明,与传统基于动态规划的算法相比,该算法获得的最小初始标识估计具有更小的托肯总数。     

An algebraic approach to revising propositional rule-based knowledge bases

One of the important topics in knowledge base revision is to introduce an efficient implementation algorithm. Algebraic approaches have good characteristics and implementation method; they may be a choice to solve the problem. An algebraic approach is presented to revise propositional rule-based knowledge bases in this paper. A way is firstly introduced to transform a propositional rule-based knowledge base into a Petri net. A knowledge base is represented by a Petri net, and facts are represented by the initial marking. Thus, the consistency check of a knowledge base is equivalent to the reachability problem of Petri nets. The reachability of Petri nets can be decided by whether the state equation has a solution; hence the consistency check can also be implemented by algebraic approach. Furthermore, algorithms are introduced to revise a propositional rule-based knowledge base, as well as extended logic programming. Compared with related works, the algorithms presented in the paper are efficient, and the time complexities of these algorithms are polynomial.     

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.