基于扩展模糊Petri网的知识推理方法研究

为使模糊Petri网能够描述可变模糊隶属判据下的模糊知识,利用基准变换能较好地表达模糊隶属判据可变情况的特点,基于定性映射和定性基准变换对模糊Petri网进行了扩展,给出了扩展后网模型的形式定义和基本运行机制。通过利用定性映射描述模糊产生式规则,给出了一种新的知识表示模式和推理方法,新方法有利于构建模糊Petri网基于认知的学习机制。结果显示,该网模型具有较强的知识表达能力,适用于处理认知模糊不确定性知识,其推理过程能体现某些认知特性,尤其适用于构建以定性判断为特点的智能系统。     

基于知识Petri网和归结规则的推理方法

本文提出了一种基于知识Petri网和归结规则的推理方法.通过知识Petri网描述命题逻辑知识库,将归结规则映射到知识Petri网上,根据库所和变迁的连接关系,定义了知识Petri网中的归结结构.利用归结结构,给出了基于知识Petri网的归结推理算法和扩展知识库的推理算法,并利用Wumpus实例验证了推理算法.该推理方法是可靠且完备的,能够利用知识Petri网的网络结构降低计算复杂性.     

基于Petri网的工作流过程模型及资源分布分析

针对工作流系统的特点对时延Petri网模型进行扩展,提出了一种新的工作流建模方法,即扩展时延Petri网。给出了扩展时延Petri网的定义,并用该方法分析了工作流四种基本模型;给出了利用排队论和随机Petri网理论计算工作流模型时间性能指标的新方法,用这种方法可求得与实例到达率相关的工作流模型平均完成时间。最后应用上述方法讨论了工作流资源分布的几种模式,并与模拟结果加以对比,计算结果的最大误差在3%左右,说明基于扩展时延Petri网的方法是分析工作流系统时间性能的有效方法。     

面向对象的Petri网建模技术的研究

将面向对象的概念引入到Petri网建模技术中，对网进行分类与抽象，给对象模型的消息和方法赋予新的含义，并将Petri网扩展成具有输入与输出的开放式系统，从而形成了面向对象的Petri网建模技术（简称OPNe技术）。给出的OPNet建模技术的一般方法具有较大的实际意义。     

一种扩展了价格信息的Petri网

提出一种扩展了价格信息的Petri网——价格Petri网，讨论了相应的分析方法和应用前景。主要工作是：为Petri网的变迁引入价格参数，并用价格变迁系统给出价格Petri网的语义；对价格Petri网进行了可达性分析并讨论了最小成本可达问题的可判定性；最后用价格Petri网建立一个业务流程的成本模型。结论是：为Petri网扩展价     

利用上下位关系的中文短文本分类

针对短文本长度短、描述信号弱的特点,提出了一种利用上下位关系的中文短文本分类框架。该框架首先利用“知网”确定训练文本中概念对的上下位关系,进而确定词语对的上下位关系,再将其用于扩展测试文本的特征向量,从而实现对测试文本的分类。实验表明：利用上下位关系能够改善短文本的分类性能。     

一种扩展了价格信息的时间Petri网

性能和成本分析是业务流程建模的主要目的,扩展了时间信息的Petri网能够有效地进行性能分析,但是对成本分析却无能为力.提出一种扩展了价格信息的时间Petri网--价格时间Petri网.首先为时间变迁扩展价格参数,并使用价格时间变迁系统给出价格时间Petri网的语义;然后提出计价状态类的概念,并证明为状态类扩展累积成本的合理性和完备性;进而给出一种算法来证明有界价格时间Petri网的最小成本可达问题是可判定的;最后给出一个应用例子并得出结论:为时间Petri网扩展价格信息并将其应用于业务流程管理领域是可行的.     

基于带抑止弧时间Petri网的IEEE802.2LLC3型协议的建模

该文定义了一种扩展的时间Petri网———带抑止弧的时间Petri网,这类扩展的时间Petri网可以用作网络协议描述的工具。作为一个例子,笔者在对IEEE802.2LLC3型协议做简单分析的基础上,给出了一个基于带抑止弧时间Petri网的IEEE802.2LLC3型协议的形式描述。     

基于Petri网的半导体生产线建模

总结了Petri网在半导体生产线建模中的应用,着重针对半导体生产线大规模,可重入,可靠性,混合加工方式,不确定性等特殊复杂性,对多种扩展Petri网模型进行了分析和比较,并进一步探讨了基于Petri网模型和扩展Petri网模型的半导体生产线建模方式,指出了存在的问题,并探讨了可能的研究方向。     

用智能Petri网实现最短路径问题

文中提出了具有人工智能的Petri网模型,并以最短路径问题为例说明了这种智能的Petri网的实用性,扩展了传统Petri网的应用范畴.     

Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

As far as we know, the testing problem of legal firing sequence is NP-complete for gener-al Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classes, such as persistent Petri nets, conflict-free Petri nets and state machine Petri nets. In this paper, the language properties of synchronous composition net are discussed. Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed. Therefore, net classification of polynomial-time solvability for testing legal firing sequence is extended.     

Petri网语言表达式及其求解算法

Petri网语言是描述网系统动作序列的集合.为了给出一个网系统语言的形式描述,基于Petri网的状态转换图,分析了Petri网的行为特征,定义了α闭包表达式和Petri网语言表达式,给出了求解Petri网语言表达式的算法,为Petri网语言的形式化描述和分析提供了一种新方法.     

基于库所有色Petri网的故障诊断算法研究

基于库所有色Petri网的故障诊断技术充分利用Petri网在故障分析和诊断中的优势,以船舶电站故障数据集为基础构造模型;并结合故障诊断实际对传统有色Petri网作适当改进,实现图形化故障树的分层分类着色显示,并以简单的矩阵运算实现故障诊断,从而有效弥补了传统Petri网在实际应用中的缺陷,适应了故障诊断的分析和建模需要。     

A Petri net model for integrated process and job shop production planning

In this paper a new Petri net class (Chameleon systems) for modeling and analyzing joined process planning and job shop production planning is proposed based on the multi-level Petri net model introduced by Valk (1995). Chameleon system is a High-level Petri net extended with time that consists of a High-level Petri net modeling the workshop which is called system net and ordinary Petri net modeling the jobs and setups which act as tokens of the system net and therefore are called token nets. Process plans of the jobs are partial orders of operation groups and alternatives. The uncertainty of operation duration is captured by a new time model. The advantages of this new modeling approach are the following: (i) a modular construction of the joined process and job shop planning is allowed, (ii) classical known Petri net analysis methods can be applied and (iii) the analysis can be done at different levels of abstraction.     

工作流过程定义中的分层结构与正则Petri网

The abstract level problem and the classification of the abstract level problem in the workflow process model are discussed. The formalized problem of the abstract level problem in the process model is researched. The concept and definition of the petri net with end-transition and normal petri net according to the control abstract level problem are put forward and discussed. The equivalence of general Petri Net and general Petri Net is proved by the petri net with priori relationship.     

虚拟制造企业的Petri网建模/仿真

为降低Petri网建模难度并增强模型的可读性，提出一种通过消息序列表（Message Sequence Chart，MSC）模型对虚拟制造（Virtual Manufacturing，VM）企业的生产经营过程进行Petri网建模的新方法．建立冲突消解机制，给出从MSC模型到Petri网模型的转换算法，在不改变Petri模型活性、安全性和有界性等特性的基础上对其进一步优化，并对Petri网模型进行分析与评估．     

基于Petri网的新型墙材生产系统建模

新型墙材生产是一个生产时间连续、工艺路线单一的制造过程,具有产品种类较少、原料配方固定、加工控制严格等特点。本文研究Petri网中库所的时间因素和变迁速率,利用成熟的Petri网理论的描述手段建立新型墙材生产系统的Petri网模型,基于赋时库所Petri网模型获得系统最大生产速率。该模型有助于企业通过选择指标来协调生产,以达到理想的生产状态。     

Blocking and controllability of Petri nets in supervisory control

This note discusses the use of Petri net languages in supervisory control theory. First it is shown that the trimming of an unbounded Petri net is not always possible and a new class of Petri net languages, that may be generated by nonblocking nets, is defined. Secondly, necessary and sufficient conditions for the existence of a Petri net supervisor, under the hypothesis that the system's behavior and the legal behavior are both Petri net languages, are derived. Finally, by means of an example, it is shown that Petri net languages are not closed under the supremal controllable sublanguage operator     

Two theoretical and practical aspects of knitting technique:invariants and a new class of Petri net

We present two aspects of knitting technique, the structural properties (especially the P- and T-invariants), and the synchronized choice net (a new class of Petri net), that are of both theoretical importance and practical uses to the verification of structural correctness of a Petri net or to detect the structural problem of a Petri net. This work first proves that the ordinary Petri nets synthesized with knitting technique are structurally bounded, consistent, conservative and safe (when each home place holds one token) using the well-known linear algebra approach. It also provides a procedure for finding P- and T-invariants for Petri net synthesized using the knitting technique. We present examples for P-invariants and show that we can synthesize Petri nets more general than the "asymmetric-choice nets". The algorithm for finding P-invariants of ordinary Petri nets is extended to find the P-invariants for a general Petri net synthesized with knitting technique and the arc-ratio rules. We present a new class of Petri nets, called synchronized choice nets, which are the largest set of Petri nets that can be covered by both T-components and P-components. An algorithm is proposed to find its T-components and the P-components, respectively. The complexity of this algorithm is also presented. The theory of synchronized choice nets has the potential to simplify that for free choice nets.     

Petri网的组合积网及性能分析

Petri网是一种系统描述和分析的工具 .Petri网组合是由小系统的性质获得大系统性质的一种有效的分析方法 .本文提出了 Petri网的组合积运算 ,包括 Petri网的 型组合积运算和 型组合积运算、Petri网的并积运算 ,讨论了保持网的结构性质的条件 ,为复杂大系统的分析提供了新途径