一种基于Petri网的工程管理模型

提出了用Petri网建立工程管理模型.为了适应在工程管理中的应用,对Petri网理论进行了扩充,提出了判定库所的概念,设计了托肯移动的规则,使用优先矩阵描述了托肯的移动.     

有界Petri网的进程表达式

提出了有界Petri网的进程表达式的概念,并给出了求有界Petri网进程表达式的一个算法.一个有界Petri网的进程表达式是以该网的基本子进程集为字母表的正规表达式.它所表示的正规集是该Petri网全体满进程的集合.所谓满进程,是指每个s切对应着Petri网的一个可达标识的那类进程.     

P/R网和进程(Ⅰ)

Petri网是描述、分析和设计并发行为的数学工具。然而,对于并发行为中至关重要的进程概念,网论中的定义一直未能尽如人意。本文认为,把Petri网看作平面网的传统观点是造成这种困难的重要原因,并定义了一种多层Petri网——Petri/Riemann网,简称P/R网,以图解决上述困难。本文证明了,对任意的EN系统(以及C/E系统)均存在一个P/R网表示,既反映系统的静态性质(结点间的拓扑排序),又反映系统的动态性质(事件点火的偏序关系)。P/R网到系统的映射即定义为进程。     

一类含时间因素的 Petri 网及其在工程上的应用

Petri 网是一种用于描述系统的动态行为和分析系统的动态性质的数学模型.一个Petri 网实质上是一个带标识的有向偶图.有向偶图描述系统的静态结构,而标识指出系统所处的状态.当一个 Petri 网的标识按一定规律发生变化时,就形象地模拟了系统的动态行为.自1962年被提出以来,Petri 网理论得到了迅速的发展和广泛的应用.如今,Petri网已被用作对大型操作系统、分布式数据库、通讯协议、并行程序以及许多计算机系统进行分析和设计的手段.此外,在化学、工程技术、法律及其他领域里,也不乏 Petri 网应用的实例.     

出现网的同步距离

六十年代初期,C.A.Petri(西德)开始用有两类节点的网模拟系统.这种网后来被称为Petri网,廿多年来已得到广泛应用.七十年代初Petri和他的同事们着手研究通用网理论(General Net Theory),八十年代初通用网论的文献开始大批出现,其应用领域包括物理、化学、工程、法律、逻辑、计算机科学等三十几个学科,并将对数学本身的发展产生积极的影响.     

带有同步变迁的有界Petri网系统的建模及可达性分析

由于存在可达标识集的爆炸性问题,大型Petri网系统的建模及可达性分析等问题的研究存在难度.文章利用矩阵的半张量积工具,研究了带有同步变迁的有界Petri网系统的建模及可达性问题.一方面,由于该类Petri网系统可以看作是由若干个子Petri网系统组成,所以可以用半张量积工具表述得到整个Petri网系统的矩阵表示.另一方面,在得出的矩阵表示的基础上,研究了两个标识之间可达性的充要判据,并给出了求可达变迁序列的算法.最后,文章用实例验证了该算法的正确性.所提出的方法在一定程度上解决了状态空间爆炸问题,并易于计算机实现.     

K(0,1)-TPN方法在三防系统安全性分析应用

三防系统软件是坦克装甲车辆防护系统中的安全关键软件,对其安全性分析是十分必要的.定义了k(0,1)—时间Petri网(K(0,1)-TPN),该网是对时间Petri网的一种扩展,对于输入不同、运行过程相同及其控制机构相同或不同的系统分析建模具有普遍的应用价值.应用k(0,1)—时间Petri网及其动态的运行规则,并采用合成技术建立起了三防系统的模型.通过对运行时序、状态转移等的分析,得出了若干个三防软件系统存在的危险状态,并对软件及其系统的修改提出了建议.     

基于奇偶校验的Petri网控制器的故障检测

提出基于奇偶校验的方法对Petri网控制器进行故障检测.设计出满足包含标识向量和Parikh向量的线性约束的Petri网控制器;建立一个包含一定数量库所的附加Petri网控制器以满足奇偶校验的编码要求;分别针对库所故障和变迁故障,选用不同的奇偶校验参数进行故障检测,并通过实例详细阐明了故障检测的过程.     

矿尘影响下生态系统脆弱性级联传播模型分析

为了解决矿尘连续排放并迁移对地表生态系统造成的脆弱性问题,提出了基于函数地理Petri网的脆弱性级联传播模型。综合考虑污染物迁移方向和生态环境在地理空间上的关联关系,直观地构造了基于级联传播的污染Petri网。在此基础上,定义了基于VCPM的脆弱度和阈值的概念,利用两者的关系进行脆弱性级联传播分析,从而明确级联传播的三种状态。最后,以神府煤田矿尘迁移作为污染物连续排放的污染源,通过模型方法的模拟仿真分析,对生态环境系统在级联传播下的脆弱性进行了深入探讨。已有的研究方法和结果不仅在生态环境脆弱性研究领域做出了新的贡献,而且为环境的修复和重建提供了参考价值。     

非肯定型工程问题的 Petri 网方法

一项工程一般都包含着多道工序.如果知道了各工序的工期以及工序之间的衔接关系,就可以画出工程的流程图.从工序流程图可以求出完成这项工程的最短时间和每个工序的最晚必须开工时间,并确定主工序线.这样便于统筹安排,提高施工效率.这就是统筹方法.我们提出解决这类工程问题的另一种方法:Petri 网方法.在[2]中我们定义了一类含时间因素的 Petri 网,并用这种网及其可达标识图对肯定型工程问题进行了分析和讨论.本文作为[2]的续篇,我们用 Petri 网方法讨论和分析非肯定型工程问题.     

一类基于随机着色Petri网的多级供应链可靠性模型研究

由多种要索组成的供应链系统在实际运作过程中必须符合可靠性要求。供应链系统由于内外部的不确定性，特别是外部需求不确定性而与其他可靠性系统有所不同。本文在考虑其可靠性问题的条件下，提出了一种随机着色Petri网来对供应链系统可靠性问题进行建模分析。     

基于时间Petri网的供应链网络关键路径分析

讨论了供应链网络中如何选择优化路径的问题,提出采用时间P etri网对供应链网络关键路径建模的方法.此方法根据顾客需要货物的情况,有条件地选取供应链网络图中可跨越活动和可替换分支,将网络图分别描述成Ebs图和Ew f图,结合时间P etri网的可达算法,求得Ebs和Ew f的关键路径.通过基本供应链的分析,得到网络的优化路径.     

Specification and verification of safety properties along a crossing region in a railway network control

Modeling the controller of the railway network, having resource sharing based on mutual exclusion constraints, is an important problem. This paper firstly addresses the specification of safety properties for the model of a complex railway crossing. The operations, i.e., occupied, free and block, are formalized to describe the safety properties along railway crossing. Second, to develop the control model of the crossing system we construct the subnet representing the train flow along the tracks in the crossing region and the set of monitors or supervisors are also modeled as subnets. Arc-constant colored Petri net (ac-CPN) is used to construct the train flow subnet while the monitors are modeled using the place/transition-net. Arc-constant colored Petri net enforces the specification of not to shift the train from a track to another one. Bottom-up approach is adopted to model the control for railway crossing as a synchronous synthesis of the subnets is applied to build the final model. Finally, to verify the safety properties in the developed controller, the coverability tree method is used for the analysis of the final model.     

A framework for solving network revenue management problems with customer choice behavior

Revenue management is the process of understanding, anticipating and influencing consumer behavior in order to maximize revenue. Network revenue management models attempt to maximize revenue when customers buy bundles of multiple resources. The dependence among the resources in such cases is created by customer demand. Network revenue management can be formulated as a stochastic dynamic programming problem whose exact solution is computationally intractable. Solutions are based on approximations of various types. Customer choice behavior modeling has been gaining increasing attention in the revenue management. A framework for solving network revenue management problems with customer choice behavior is proposed. The modeling and solving framework is composed from three inter-related network structures: basic network model, Petri net, and neural net.     

具有随机需求的多种差异产品供应链网络均衡模型研究

针对产品的品牌和产地存在的差异性,研究了供应链网络的均衡模型,构建了具有随机需求的多种差异产品的供应链网络均衡模型.运用随机效用理论和多项式logit模型分析了需求市场上产品的随机选择问题,利用变分不等式的形式给出了制造商、零售商,需求市场以及整个供应链网络的均衡条件,并给出了经济解释.最后,通过算例验证了模型的合理性.     

Generalized minimal cost flow problem in fuzzy nature: An application in bus network planning problem

The aim of minimal cost flow problem (MCFP) in fuzzy nature, which is denoted with FMCFP, is to find the least cost of the shipment of a commodity through a capacitated network in order to satisfy imprecise concepts in supply or demand of network nodes and capacity or cost of network links. Fuzzy supply–demand may arise in real problems, where incomplete statistical data or simulation results are used. Also, variation in the cost or capacity of links is commonly happening. In the present paper, after defining a total order on LR type fuzzy numbers, three models are studied; MCFP with fuzzy costs, MCFP with fuzzy supply–demand and a combination of two cases. For the first model, scaling negative cycle cancelling algorithm, which is a polynomial time algorithm, is proposed. For the second model, “nominal flow” is introduced which provides an efficient scheme for finding fuzzy flow. For the third model, we present an exact and some heuristic methods. Numerical examples are illustrated to demonstrate the efficiency of the proposed schemes. Finally, an application of this viewpoint in bus network planning problem is provided.     

A logistics problem: a non-markovian queueing network model and algorithm

In this paper, a stochastic version of the classical deterministic balanced single commodity capacitated transportation network problem is presented. In this model, each arc of the network connects a supply node to a demand node and the flow of units forming along each arc of the network forms a stochastic process (i.e.G/M/1 queueing system with generally distributed interarrival time, a Markovian server, a single server, infinite capacity, and the first come first served queueing discipline). In this model, the total transportation cost is minimized such that the total supply rate is equal to the total demand rate, and the resulting probability of finding excessive congestion along each arc (i.e., the resulting probability of finding congestion inside the queueing system formed along each arc in excess of a fixed number) is equal to a desirable value     

动态供应链网络均衡模型构建与分析

基于单一商品流,考虑了时间变量和库存问题,建立了三层动态供应链网络结构模型.对制造商、零售商和需求市场的多期独立决策行为及其相互作用进行了分析,应用变分不等式构建了各层均衡模型和整个供应链网络均衡模型.最后与相关文献的模型进行了比较.     

Robust controlling of chaotic behavior in supply chain networks

The supply chain network is a complex nonlinear system that may have a chaotic behavior. This network involves multiple entities that cooperate to meet customers demand and control network inventory. Although there is a large body of research on measurement of chaos in the supply chain, no proper method has been proposed to control its chaotic behavior. Moreover, the dynamic equations used in the supply chain ignore many factors that affect this chaotic behavior. This paper offers a more comprehensive modeling, analysis, and control of chaotic behavior in the supply chain. A supply chain network with a centralized decision-making structure is modeled. This model has a control center that determines the order of entities and controls their inventories based on customer demand. There is a time-varying delay in the supply chain network, which is equal to the maximum delay between entities. Robust control method with linear matrix inequality technique is used to control the chaotic behavior. Using this technique, decision parameters are determined in such a way as to stabilize network behavior.     

An Interactive Planning Model for the New Zealand Dairy Industry

A long-term planning model for a large New Zealand dairy company is described. The model presents an integrated view of the company's operation, including transportation and processing. The model used is based on a network formulation, NETPLAN, developed by the authors to carry out the optimisation. NETPLAN is highly flexible, interactive and provides graphical output of the results. The optimisation maximises net revenue based on product prices, variable process costs and variable transport costs subject to factory capacity, product demand and raw material supply constraints.