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

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

爬行机器人的分层可控混成Petri网建模研究

飞机表面爬行机器人是一个复杂的离散事件和连续动态事件相结合的混成运动系统,为描述系统的静态特性和动态行为,提出一种分层可控混成Petri网模型.依据爬行运动机构定义了Petri网模型组成元素,建立了爬行机器人单轴和双轴分层可控混成Petri网,该模型可接收上层运动轨迹指令并输出爬行动作序列.实验表明,基于该模型实施的飞...     

On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity

Petri nets are a simple formalism for modeling concurrent computation. They are also an interesting tool for modeling and analysing biochemical reaction systems, bridging the gap between purely qualitative and quantitative models. Biological networks can indeed be complex, large, and with many unknown kinetic parameters, which makes the development of quantitative models difficult. In this paper, we focus on the Petri net representation of biochemical reactions and on two structural properties of Petri nets, siphons and traps, that bring us information about the persistence of some molecular species, independently of the kinetics. We first study the theoretical time complexity of minimal siphon decision problems in general Petri nets, and present three new complexity results: first, we show that the existence of a siphon of a given cardinality is NP-complete; second, we prove that deciding the Siphon-Trap property is co-NP-complete; third, we prove that deciding the existence of a minimal siphon containing a given set of places, deciding the existence of a siphon of a given cardinality and deciding the Siphon-Trap property can be done in linear time in Petri nets of bounded tree-width. Then, we present a Boolean model of siphons and traps, and two method for enumerating all minimal siphons and traps of a Petri net, by using a SAT solver and a Constraint Logic Program (CLP) respectively. On a benchmark of 345 Petri nets of hundreds of places and transitions, extracted from biological models from the BioModels repository, as well as on a benchmark composed of 80 Petri nets from the Petriweb database of industrial processes, we show that both the SAT and CLP methods are overall faster by one or two orders of magnitude compared to the state-of-the-art algorithm from the Petri net community, and are in fact able to solve all the enumeration problems of our practical benchmarks. We investigate why these programs perform so well in practice, and provide some elements of explanation related to our theoretical complexity results.     

Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control

In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in dealing with concurrency and complexity issues. A brief overview of existing results on hybrid systems that are based on Petri nets is first presented. A class of timed Petri nets named programmable timed Petri nets (PTPN) is then used to model hybrid systems. Using the PTPN, the stability and supervisory control of hybrid systems are addressed and efficient algorithms are introduced. In particular, we present sufficient conditions for the uniform ultimate boundness of hybrid systems composed of multiple linear time invariant plants which are switched between using a logical rule described by a Petri net. This paper also examines the supervisory control of a hybrid system in which the continuous state is transfered to a region of the state space in a way that respects safety specifications on the plant's discrete and continuous dynamics.     

基于Petri网的道路交叉口建模方法及比较研究

离散Petri网和连续Petri网的各自优势和缺点明显,前者建模准确但复杂度高,后者复杂度较低但模型不够精确。混合Petri网作为两者的结合,能在一定程度上弥补各自的缺点,非常适合用于道路交叉口系统的建模。但是以往的文献中缺乏纯离散模型和混合模型之间的定量比较。提出了一种自上而下的混合Petri网方法,能够快速建立道路交叉口系统模型;以一个4相位固定相序交叉口为例,建立其混合Petri网模型并与纯离散模型进行了定量的比较与分析。通过对不同系统负载下交叉口内交通流排队长度的仿真,并考察混合模型与离散模型之间的误差变化,在一定程度上为模型选择的合理性提供了定量的依据。     

Decidability results in First–Order Hybrid Petri Nets

In this paper we tackle the decidabilityof marking reachability for a hybrid formalism based on Petrinets. The model we consider is the untimed version of First–OrderHybrid Petri Nets: it combines a discrete Petri net and a continuousPetri net, the latter being a fluid version of a usual discretePetri net. It is suggested that the decidability results shouldbe pursued exploiting a hierarchy of models as it has been donein the framework of Hybrid Automata. In this paper we definethe class of Single–Rate Hybrid Petri Nets: the continuousdynamics of these nets is such that the vector of the markingderivatives of the continuous places is constant but for a scalarfactor. This class of nets can be seen as the counterpart oftimed automata with skewed clocks. We prove that the reachabilityproblem for this class can be reduced to the reachability problemof an equivalent discrete net and thus it is decidable.     

神光III控制系统的故障建模与分析

应用混合随机Petri网对神光III控制系统的故障进行了建模,并应用Visobj Net对建立的故障模型进行了仿真分析。网络化控制系统是一个离散和连续相结合的混合动态系统,具有动态、并发及同步等特征;神光III控制系统就是网络化控制技术在武器装备上的一个典型应用;对于复杂系统的建模和分析,Petri网是一个非常有效的工具。Petri网已经被证明是离散事件或异步系统很好的建模和分析工具,混合随机Petri网是Petri网的一个扩展,具有强大的建模功能。仿真结果表明,所建立的模型是正确的。     

Parallel program design using high-level Petri nets

Petri nets are proposed as a general-purpose design and modelling tool for parallel programs. The advantages of Petri nets for this purpose are discussed, and a solution to the Dining Philosophers problem is developed using simple Place-Transition nets. The limitations of Place-Transition nets are described, and the Dining Philosophers problem is used to illustrate how Coloured Petri nets can overcome these limitations. A more complex example of a Coloured Petri net is then given, and it is shown how a collection of processes in the Occam programming language can be developed directly from the properties of the net. Another Petri net model of a simple process farm is given, and a solution is developed in Parallel C: this further highlights the suitability of Petri nets as a design tool for parallel programs.     

资源配置混杂Petri网的混杂系统生产过程动态调度

为了增强混杂生产过程应对突发事件的能力,以一种新的混杂Petri网(资源配置混杂Petri网)为研究模型,给出了相应的使能和激发规则.并在资源配置混杂Petri网建立的仿真模型的基础上,融入事件逻辑网和逻辑规划,提出一种适用于混杂系统动态生产调度建模和优化的方法.以典型的混杂生产过程为例,研究混杂系统生产过程建模及优化.研究结果表明,资源配置混杂Petri网模型描述能力强,能够有效描述混杂系统生产过程,所提出的动态调度方案切实有效.     

A Petri net representation of Bayesian message flows: importance of Bayesian networks for biological applications

This article combines Bayes’ theorem with flows of probabilities, flows of evidences (likelihoods), and fundamental concepts for learning Bayesian networks as biological models from data. There is a huge amount of biological applications of Bayesian networks. For example in the fields of protein modeling, pathway modeling, gene expression analysis, DNA sequence analysis, protein–protein interaction, or protein–DNA interaction. Usually, the Bayesian networks have to be learned (statistically constructed) from array data. Then they are considered as an executable and analyzable model of the data source. To improve that, this work introduces a Petri net representation for the propagation of probabilities and likelihoods in Bayesian networks. The reason for doing so is to exploit the structural and dynamic properties of Petri nets for increasing the transparency of propagation processes. Consequently the novel Petri nets are called “probability propagation nets”. By means of examples it is shown that the understanding of the Bayesian propagation algorithm is improved. This is of particular importance for an exact visualization of biological systems by Bayesian networks.     

基于Petri网的模型组合方法研究

模型组合是DSS研究应用的重要组成部分,为了分析模型集成过程中数据集成和逻辑集成的关系,定义了一个基于Petri网的模型组合方案,将模型组合的要素映射到Petri网结构。利用Petri网提供的分析技术,辅助复杂业务流程的建模,从而在逻辑上提供了模型组合的性能和正确性验证。     

On Resource Arc for Petri Net Modelling of Complex Resource Sharing System

PFS-R – Production Flow Schema with Resources – is a novel graphical representation for complex resource sharing discrete production systems proposed in this paper. The PFS-R is an augmented version of the PFS (Production Flow Schema, previously proposed by the authors) which includes correspondences of system resources at each production step. The PFS-R is able to model system structures as well as system behaviours in a more simplified and transparent manner than ordinary Petri net representations. That is, the PFS-R solves an important drawback when actually adopting Petri nets as a design technique for intelligent manufacturing systems. First, the paper introduces the basic elements of PFS-R, and the equivalent transformations of PFS-R model into hybrid nets and Petri nets, taking into account the net conservativeness. Next, examples of discrete production systems to illustrate the effectiveness of PFS-R are presented. In addition, it is shown, using an example, that the correspondence between resources and production steps in the process flow has a tree structure, which is an effective way to evaluate whether or not the objects designed have a well-defined structure.     

基于PETRI网的工作流模型分析与应用

目前,工作流的建模和分析工具有很多,由于Petri网具有坚实的理论基础和易于使用的图形表示,因而是一种理想的建模和分析工具。论文着重讨论基于Petri网的工作流模型的分析技术,对其基本的过程和所涉及的问题进行了分析,尤其对模型正确性的判定等问题,进行了详细的阐述。在文章最后,将给出一个应用的实例:全国高校网上招生录取系统。     

基于资源配置混杂Petri网的混杂系统生产过程建模

为了增强混杂Ｐｅｔｒｉ网解决资源共享和资源冲突的能力,定义一种新的混杂Ｐｅｔｒｉ网模型———资源配置混杂Ｐｅｔｒｉ网,提出了相应的使能和激发规则．将对连续变迁和离散变迁的控制作用引入混杂Ｐｅｔｒｉ网,同时,增加了资源配置变迁和资源释放变迁,用于有效分配可重复利用的资源．以典型的混杂生产过程为例,研究混杂系统生产过程建模．研究结果表明,所定义的模型描述能力强,模型语义正确合理,能够有效描述和分析混杂系统生产过程．     

Timing and liveness in continuous Petri nets

Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreover, the class of continuous models thus obtained may be interesting in itself. In Petri nets, fluidification leads to the so-called continuous Petri nets, which are technically hybrid models. Under infinite server semantics, timing a continuous Petri net model preserves the liveness property, but the converse is not necessarily true, and if the autonomous net model is not live, the timing may transform it into a live model. In this paper, we investigate the conditions on the firing rates of timed continuous models that make a given continuous system live.     

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.     

Robot task plan representation by Petri nets: modelling, identification, analysis and execution

In this paper we introduce a framework to represent robot task plans based on Petri nets. Our approach enables modelling a robot task, analysing its qualitative and quantitative properties and using the Petri net representation for actual plan execution. The overall model is obtained from the composition of simple models, leading to a modular approach. Analysis is applied to a closed loop between the robot controller and the environment Petri net models. We focus here on the quantitative properties, captured by stochastic Petri net models. Furthermore, we introduce a method to identify the environment and action layer parameters of the stochastic Petri net models from real data, improving the significance of the model. The framework building blocks and a single-robot task model are detailed. Results of a case study with simulated soccer robots show the ability of the framework to provide a systematic modelling tool, and of determining, through well-known analysis methods for stochastic Petri nets, relevant properties of the task plan applied to a particular environment.     

Verification of causal models using petri nets

Many different approaches, mainly based on logical formalisms, have been proposed for modeling causal knowledge and the inferential mechanisms based on this type of knowledge. In this article we present an alternative approach to this problem in which the semantics of a causal model is provided by adopting Petri nets. We show how this scheme of modeling is powerful enough to capture all crucial aspects of the corresponding causal model, without resorting to very complex structures; indeed, the model is obtained using a particular type of deterministic Petri net. Moreover, a complete formalization of the aspects concerning the correctness of the represented causal model is provided in terms of reachability in the Petri net. We believe that this aspect is very important in the knowledge acquisition phase when precise correctness criteria should be defined and respected in the construction of the model. We analyze some of these criteria and we discuss an algorithm (based on a backward simulation of the net) capable of discovering incorrectness by exploiting analysis tools available for Petri nets and the explicit parallelism of the model. © 1992 John Wiley & Sons, Inc.     

Possibilistic Petri nets

This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems. The paper presents relevant concepts of Petri nets with objects and possibility logic and how imprecision and vagueness are introduced in the marking of a Petri net with objects. The marking of a net is imprecise, or in a more general way, fuzzy, in order to represent an ill-known knowledge about a system state. A new marking updating according to the fuzzy marking such defined is also discussed. An example of shop door monitoring is presented that illustrates our approach.     

Knowledge intensive Petri net framework for concurrent intelligent design of automatic assembly systems

The integration of design and planning of flexible assembly system has been recognized as a tool for achieving efficient assembly in a production environment that demands assembly with a high degree of flexibility. This paper proposes a concurrent intelligent approach and framework for the design of robotic flexible assembly systems. The principle of the proposed approach is based on the knowledge Petri net formalisms, incorporating Petri nets with more general problem-solving strategies in AI using knowledge-based system techniques. The complex assembly systems are modeled and analyzed by adopting a formal representation of the system dynamic behaviors through knowledge Petri net modeling from the specifications and the analysis of those models. A template is first defined for a knowledge Petri net model, and then the models for assembly system individuals are established in the form of instances of the template. The design of assembly systems is implemented through a knowledge Petri net-based function–behavior–structure model. The research results show that the proposed knowledge Petri net approach is applicable for design, simulation, analysis and evaluation, and even layout optimization of the flexible assembly system in an integrated intelligent environment. The integration of assembly design and planning process can help reduce the development time of assembly systems.