AN EQUIVALENCE METHOD FOR COLOURED PETRI NETS AND PLACE/TRANSITION NETS

Coloured Petri net(CPN)is a high-level net while place/transition net(PTN)is a low-level net.It is very important to establish the relationship betweenthe two nets both in theoretical analysis and practical application.In this paper,wegive a formal method of translating a CPN into a behaviourally equivalent PTN.APTN and its behaviour are formally constructed,a PTN equivalence definition is giv-en,and the same properties of the two nets are proved.

Boundedness and liveness enforcement for labeled Petri nets using transition priority

This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condition is given and proven for the existence of a feasible priority-based controller based on the notions of liveness and transition invariants. Next, a cyclic behavior graph is constructed, which shows the reachable markings that guarantee the maximum liveness of the system within a given bound vector. Finally, an on-line control strategy is proposed to enforce boundedness and liveness to the given system by appending priority relations to transitions. The dynamic priority relation changes flexibly according to the current state of the system and enforces the system evolving in a bounded and live manner. In addition, numerical examples are studied to verify the validity of the proposed approach that remains the structure of the plant net and is efficient for on-line control.

TAR~*:an improved process similarity measure based on unfolding of Petri nets

Determining the similarity degree between process models was very important for their management,reuse,and analysis.Current approaches either focused on process model's structural aspect,or had inefficiency or imprecision in behavioral similarity.Aiming at these problems,a novel similarity measure which extended an existing method named Transition Adjacent Relation(TAR) with improved precision and efficiency named TAR * was proposed.The ability of measuring similarity was extended by eliminating the duplicate tasks without impacting the behaviors.For precision,TARs was classified into repeatable and unrepeatable ones to identify whether a TAR was involved in a loop.Two new kinds of TARs were added,one related to the invisible tasks after the source place and before sink place,and the other representing implicit dependencies.For efficiency,all TARs based on unfolding instead of its reach ability graph of a labeled Petri net were calculated to avoid state space explosion.Experiments on artificial and real-world process models showed the effectiveness and efficiency of the proposed method.

Modeling of Fuel Elements Cycling System in Pebble Bed Reactor Based on Timed Places Control Petri Nets

Pebble bed reactors use cycling scheme of spherical fuel elements relying on fuel elements cycling system (FECS). The structure and control logic of FECS are very complex. Each control link has strict requirements on time and sequence. This increases the difficulties of description and analysis. In this paper, timed places control Petri nets (TPCPN) is applied for the modeling of FECS. On this basis the simulation of two important processes, namely uploading fuel elements into the core for the first time and emptying the core is finished by simulation software Arena. The results show that as TPCPN is able to describe different kinds of logic relationship and has time properties and control properties, it’s very suitable for the modeling and analysis of FECS.

Methods for behavior descriptions of structure-complex Petri nets

Petri net language is a powerful tool for describing dynamic behaviors of physical systems. However, it is not easy to obtain the language expression for a given Petri net especially a structure-complex net. In this paper, we first analyze the behaviors of S-nets, which are structure-simple. With the decomposition method based on a given index function on the place set, a given structure-complex Petri net can be decomposed into a set of structure-simple S-nets. With the language relationships between the original system and the decomposed subnets, an algorithm to obtain the language expression of a given structure-complex net system is presented, which benefits the analysis of physical systems based on the Petri net language.

Designing Genetic Regulatory Networks Using Fuzzy Petri Nets Approach

In this paper, we have successfully presented a fuzzy Petri net （FPN） model to design the genetic regulatory network. Based on the FPN model, an efficient algorithm is proposed to automatically reason about imprecise and fuzzy information. By using the reasoning algorithm for the FPN, we present an alternative approach that is more promising than the fuzzy logic. The proposed FPN approach offers more flexible reasoning capability because it is able to obtain results with fuzzy intervals rather than point values. In this paper, a novel model with a new concept of hidden fuzzy transition （HFT） to design the genetic regulatory network is developed. We have built the FPN model and classified the input data in terms of time point and obtained the output data, so the system can be viewed as the two-input and one output system. This method eliminates possible false predictions from the classical fuzzy model thereby allowing a wider search space for inferring regulatory relationship. The experimental results show the proposed approach is feasible and acceptable to design the genetic regulatory network and investigate the dynamical behaviors of gene network.

Modeling and Analyzing of Breast Tumor Deterioration Process with Petri Nets and Logistic Regression

It is important to understand the process of cancer cell metastasis and some cancer characteristics that increase disease risk.Because the occurrence of the disease is caused by many factors,and the pathogenesis process is also complicated.It is necessary to use interpretable and visual modeling methods to characterize this complex process.Machine learning techniques have demonstrated extraordinary capabilities in identifying models and extracting patterns from data to improve medical prognostic decisions.However,in most cases,it is unexplainable.Using formal methods to model can ensure the correctness and understandability of prediction decisions in a certain extent,and can well visualize the analysis process.Coloured Petri Nets(CPN)is a powerful formal model.This paper presents a modeling approach with CPN and machine learning in breast cancer,which can visualize the process of cancer cell metastasis and the impact of cell characteristics on the risk of disease.By evaluating the performance of several common machine learning algorithms,we finally choose the logistic regression algorithm to analyze the data,and integrate the obtained prediction model into the CPN model.Our method allows us to understand the relations among the cancer cell metastasis and clearly see the quantitative prediction results.

维修工作仿真中的PetriNet—PaTNet方法

为了有效地应用维修工作(作业)仿真方法,从维修工作的表达、维修工作动画实现两个方面展开了研究工作。基于人体建模软件Jack,提出了一种Petri网与PaTNet相结合的方法来实现维修工作仿真,并研究了维修工作内容描述、场景对象模型以及相应的实现框架。最后通过一个实例证实了PetriNet-PaTNet方法的作用。

进程互斥算法的Petri Net实现

针对两个进程互斥进入临界区算法的不足,利用Petri Net中库所和变迁的元素来逐一进行图形化的描述。为得到遵守同步机制四准则的解决方案,采用逐步演进的方法。此算法可以有效的利用资源,且能保证同步机制中"忙则等待",又实现了"空闲让进"的原则,使得算法满足实现进程互斥的三原则,避免了错误的发生。

CERNET的Petri网建模及性能指标评估

构造了ＣＥＲＮＥＴ的性能指标评估Ｐｅｔｒｉ网模型，并据现有的统计资料得出了模型的具体参数．提出了一种计数禁止弧的新概念，并给出了它的一系列基本性质．最后，通过对Ｐｅｔｒｉ网模型的求解，给出了未来中国教育科研网的几个重要的性能指标．通过对性能曲线的分析。

双层变迁定时Petri Net抽象化

该文对双层变迁定时Petri Net进行了抽象化。抽象化的双层变迁定时Petri Net可用于嵌入式系统设计过程的中间态模拟。

基于Petri网和改进遗传算法的多资源调度问题

针对混流装配线工序加工资源需求多样、工艺复杂、装配工期长等问题,采用Petri网和改进遗传算法对该问题进行优化求解。建立混流装配线赋时库所Petri网(timed place Petri net, TPPN)调度模型,基于模型激发序列,采用基于工序的编码方式进行染色体编码;采用精英保留策略选择优异个体,改进遗传算法的交叉、变异操作,用改进后的遗传算法求解混流装配线调度问题。通过对比案例及实例数据计算结果验证了方案的有效性。

A Heuristic Method for Temporal Analysis Based on Petri Net

Reachability-based analysis and temporal analysis are used to verify the properties of concurrent systems, and it is important to exploit fast and efficient methods. This paper gives semantics of temporal formulae with edges of the transition system of Petri net, and then presents a fast temporal analyzing method, which takes advantage of both Petri net and temporal logic. The method only expands a path of equivalence trace while the path does not satisfy a property according to trace semantics of Petri net, and can validate directly the property on Petri net. Moreover, we exploit a minimal degree of in-out of a node as heuristics to select a path of an equivalence trace. Finally, we demonstrate the validity of the method that decreases state spaces and improves the verification system with the experimental results.

带有时间戳的着色逻辑Petri网

针对扩展着色逻辑Petri网存在的表达能力弱以及适用范围窄的问题,提出了一个新的Petri网模型,即带有时间戳的着色逻辑Petri网。首先,将颜色进行实例化以及将变量用于构建有向边上的表达式使得模型能够传递复杂的数据流。其次,引入全局时间以及令牌的时间戳等概念为变迁使能规则增加时间上的约束,使得模型能够用于模拟实时系统。再次,定义库所约束函数并为变迁使能规则增加输出库所上的约束,使得模型能够适用于存储资源有限的场景。接着,提出基于逻辑变迁输入输出矩阵的匹配法,降低逻辑输入变迁的使能判定计算开销并简化逻辑输出变迁的使能判定计算过程。然后,重新定义适用于三类变迁的使能判定条件以及适用于三类库所的标记更新方法,解决原有模型语义在新模型中不适用的问题。最后,通过实例说明新的Petri网模型具有更强的表达能力和适用范围,它能够适用于传递复杂数据流、存储资源有限、实时的且包含批处理选择结构的系统。

Ar/T-Net:一种面向Artifact的业务过程概念模型

以数据为中心是业务过程管理发展的新趋势,面向Artifact的业务过程管理是一种具有代表性的以数据为中心的业务过程管理技术。概念模型设计是面向Artifact的业务过程设计的关键步骤,但目前还没有成型的建模和分析工具。利用谓词/变迁Petri-Net建模的优势,根据Artifact的特点,用嵌套关系模式定义Artifact的结构;以描述Artifact的嵌套关系模式作为谓词,提出了一种适合于概念模型设计的谓词/变迁Petri-Net,即Ar/T-Net。以可达性分析为例,讨论了Ar/T-Net的功能。

基于模糊Petri网的“网–源–储–车”动态阈值能量管理策略研究

轨道交通作为电力系统的主要用能对象之一,每年消耗大量电能用于电力机车牵引。因此,降低牵引能耗、提升供能系统的弹性与效能对促进碳达峰、碳中和具有重要的现实意义。轨道交通“网–源–储–车”协同供能系统在传统牵引供电架构的基础上引入了储能系统与新能源发电系统,然而,如何实现牵引负荷、储能系统及新能源发电系统的高效能源自洽,减少双向波动性与不确定性对能量管理系统的影响成为了新的难题。为实现以上目标,减轻牵引负荷对牵引网的功率冲击,延长储能系统的使用寿命,本文提出了一种基于模糊Petri网(fuzzy Petri nets,FPN)的“网–源–储–车”动态阈值能量管理策略。该策略在“网–源–储–车”基本功率分配框架的基础上,设定了多工况下牵引供电系统与储能系统、新能源发电系统的动态能量交互规则,可适用于不同架构的“网–源–储–车”协同供能体系;在此基础上,以电力机车功率与储能系统寿命作为模糊Petri网的输入参数,经过模糊化、Petri网推理、反模糊化等操作后实现对放电阈值的自适应动态调整。本文以某牵引变电所实测数据作为测试案例,仿真结果表明:相较于基于固定阈值的能量管理策略,基于模糊Petri网的动态阈值管理策略能够有效提升能量回馈效率与再生制动能量储存效率,同时,增加光伏发电系统的利用电度,降低电力机车经由接触网从电力系统取能的平均功率及储能系统的平均放电深度;对延长储能系统的预计寿命、提升协同供能系统的能量利用效率与运行经济性具有积极意义。

基于逆向搜索的模糊Petri网分层算法

模糊Petri网(FPN)是知识库系统(KBS)表示、建模与分析的主要工具之一。针对部分FPN层次结构不清晰、库所/变迁间从属关系不明确的问题,提出一种基于逆向搜索的FPN分层算法(HFPN-RS)以实现非层次化FPN到层次化FPN(HFPN)的自动转换。首先,从终结库所开始对整个FPN进行逆向搜索,将所有输入库所的前集、输出库所的后集分别划分在同一层;其次,通过添加虚库所-虚变迁对的方式明确整个模型的层次结构;同时提出两条相关定理以明确HFPN分层层数的下确界和层次化操作中需要添加的最少虚库所-虚变迁对数,并给出经层次化操作后具有完整分层结构的FPN模型关联矩阵维度计算公式。在实验部分,通过对几类各具特点的FPN模型进行层次化操作,并利用所提定理进行验证。实验结果表明,添加虚库所-虚变迁对后新FPN模型具有清晰的层次结构,为下一步FPN泛化能力等研究内容的深入提供了理论基础。

面向资源Petri网的自动制造系统死锁预防

在自动制造系统(automated manufacturing systems,AMSs)中,死锁是一个急需解决的问题,其主要由资源的循环等待造成.为了解决该问题,本文首先基于面向资源Petri网(resource-oriented Petri nets,ROPNs)的特征,建立特殊资源标记图(special resource marked graphs,SRMGs).其次,在SRMGs中建立死锁与饱和回路之间的关系.最后通过为一些特殊回路添加控制器,阻止系统出现不安全标记.考虑到资源故障问题,为危险库所添加资源缓冲子网,保证需要故障资源的零件不会阻塞其他零件的持续生产.相比现有的控制器,本文的监督控制器具有控制开关,其通过实时改变控制库所的容量可以允许更多安全标记发生.

Modeling and reachability analysis of synchronizing transitions bounded Petri net systems based upon semi-tensor product of matrices

The reachability problem of synchronizing transitions bounded Petri net systems （BPNSs） is investigated in this paper by constructing a mathematical model for dynamics of BPNS. Using the semi-tensor product （STP） of matrices, the dynamics of BPNSs, which can be viewed as a combination of several small bounded subnets via synchronizing transitions, are described by an algebraic equation. When the algebraic form for its dynamics is established, we can present a necessary and sufficient condition for the reachability between any marking （or state） and initial marking. Also, we give a corresponding algorithm to calculate all of the transition paths between initial marking and any target marking. Finally, an example is shown to illustrate proposed results. The key advantage of our approach, in which the set of reachable markings of BPNSs can be expressed by the set of reachable markings of subnets such that the big reachability set of BPNSs do not need generate, is partly avoid the state explosion problem of Petri nets （PNs）.