Petri网的广义笛积运算

文[1]曾给出Petri网的两种合成方法,即Ｐ／Ｔ网的加法和笛积运算。本文再提出几种Ｐ／Ｔ网的广义笛积运算,这几种运算都较好地保持网的结构性质。对此给出实例,显示了它们在Ｐ／Ｔ网的合成与分析中的作用。     

一类受控Petri网的控制器设计

通过挖掘Petri网的内在的结构特性, 获得了一种新的解决禁止状态避免问题的控制器设计方法. 这种设计方法适用于一类具有特殊结构的受控Petri网 (即所有前向路径子网是状态机 )的状态反馈控制器设计. 在非并发的假设条件下, 所综合的控制器是最大允许.     

一类离散事件系统的监控器综合

前向无同步前向无冲突网是每个变迁有且只有一个输入库所并且每个库所最多有一个输入变迁的受限Petri网.针对不可控影响子网为前向无同步前向无冲突网的广义互斥约束,显式地给出了最大允许控制策略的计算方法.并用一个例子给予了说明.     

生化网络的随机Petri网建模与分析

细胞的行为是随机性的,学习细胞中的随机性有助于理解细胞的组织,设计和进化。建立、确认和分析随机的生化网络模型是当前计算系统生物学领域的一个重要研究主题。当前,标准的Petri网模型已经成为生化网络模拟和定性分析的有力工具。尝试使用随机Petri网对生化网络进行建模与分析,简单描述了随机Petri网理论对标准Petri网的扩充,通过对二聚作用和肌动蛋白这两个典型例子的建模与演化模拟,介绍、论证了随机Petri网理论的新应用。     

Qualitative Diagnosis of Condition Systems

A condition system is a collection of Petri nets that interact with each other and the external environment through condition signals. Some of these condition signals may be unobservable. In this paper, a system fault is defined in terms of observed behavior versus expected behavior, where the expected behavior is defined through condition system models. A diagnosis of this fault localizes the subsystem that is the source of the discrepancy between output and expected observations. We show that the structure of the interacting subsystems define a diagnostic causal model that captures the causal structure of subsystem dependencies. The diagnostic causal model can then be used to determine a set of subsystems that might be the source of a fault.     

应用离散事件系统控制理论求解生产调度的新方法

众所周知, 生产调度问题属组合优化问题, 一般来说不存在求得精确最优解的多项式算法. 因此, 对于大规 模调度问题, 人们应用启发式算法和元启发式算法以企求得满意解. 在实际的应用中, 许多工业过程需要满足严格 的工艺约束. 对于这类过程的调度问题, 很难应用启发式算法和元启发式算法, 因为这些方法难于保证所求得调度 的可行性. 为了解决这一问题, 本文以半导体芯片制造中组合设备的调度问题作为例子, 介绍了一种基于离散事件 系统控制理论的生产调度新方法. 利用Petri网建模, 任何违反约束的状态均被描述为非法状态, 而使非法状态出现 的调度则是不可行调度. 通过可行调度的存在性分析, 该方法获得可行解空间并将调度问题转化为连续优化问题, 从而可以有效求解. 并且指出, 该方法可以应用于其他应用领域.     

基于动态观测的随机离散事件系统故障诊断

近年来,离散事件系统故障诊断研究引起国内外学者广泛关注.鉴于此,研究动态观测下随机离散事件系统的故障诊断.首先引入一种动态观测,使事件的可观测性随着系统的运行而动态变化;然后分别对基于动态观测的随机离散事件系统的单故障可诊断性和模式故障可诊断性进行形式化;最后通过构造相应的诊断器,分别得到关于单故障可诊断性和模式故障可...     

Modal control of linear time invariant systems

A procedure is presented for the determination of a linear control law (for a system with one input) such that the resultant closed–loop System has specified eigenvalues. The design procedure is simpler than existing techniques.     

The fundamental closed-form solution of control-related states of kth order S3PR system with left-side non-sharing resource places of Petri nets

Due to the state explosion problem, it has been unimaginable to enumerate reachable states for Petri nets. Chao broke the barrier earlier by developing the very first closed-form solution of the number of reachable and other states for marked graphs and the kth order system. Instead of using first-met bad marking, we propose ‘the moment to launch resource allocation’ (MLR) as a partial deadlock avoidance policy for a large, real-time dynamic resource allocation system. Presently, we can use the future deadlock ratio of the current state as the indicator of MLR due to which the ratio can be obtained real-time by a closed-form formula. This paper progresses the application of an MLR concept one step further on Gen-Left kth order systems (one non-sharing resource place in any position of the left-side process), which is also the most fundamental asymmetric net structure, by the construction of the system's closed-form solution of the control-related states (reachable, forbidden, live and deadlock states) with a formula depending on the parameters of k and the location of the non-sharing resource. Here, we kick off a new era of real-time, dynamic resource allocation decisions by constructing a generalisation formula of kth order systems (Gen-Left) with r^* on the left side but at arbitrary locations.     

Decentralised control of continuous Petri nets

This paper focuses on decentralised control of systems modelled by continuous Petri nets, in which a target marking control problem is discussed. In some previous works, an efficient ON/OFF strategy-based minimum-time controller was developed. Nevertheless, the convergence is only proved for subclasses like Choice-Free nets. For a general net, the pre-conditions of applying the ON/OFF strategy are not given; therefore, the application scope of the method is unclear. In this work, we provide two sufficient conditions of applying the ON/OFF strategy-based controller to general nets. Furthermore, an extended algorithm for general nets is proposed, in which control laws are computed based on some limited information, without knowing the detailed structure of subsystems.     

Gradient-based controllers for timed continuous Petri nets

This paper is about control design for timed continuous Petri nets that are described as piecewise affine systems. In this context, the marking vector is considered as the state space vector, weighted marking of place subsets are defined as the model outputs and the model inputs correspond to multiplicative control actions that slow down the firing rate of some controllable transitions. Structural and functional sensitivity of the outputs with respect to the inputs are discussed in terms of Petri nets. Then, gradient-based controllers (GBC) are developed in order to adapt the control actions of the controllable transitions according to desired trajectories of the outputs.     

基于Petri网的离散系统仿真方法研究

将Ｐｅｔｒｉ网（Ｐ网）的概念和方法应用于离散系统仿真的方法论研究中。提出了基于Ｐ网的系统化的离散系统仿真建模方法，重点研究了基于Ｐ网的仿真策略，探讨了Ｐ网仿真策略的实现方式，并对其特点进行了分析和讨论。     

随机非线性动态系统数值模拟与性态分析

针对具有随机参数非线性系统和随机非线性系统的数值模拟与性态分析问题,提出将蒙特卡罗模拟办法与数值积分法相结合,建立了迭代积分算法求取随机非线性系统在不副随机序列作用下的数值解集,分析了计算误差．其次,利用数值解集的样本值进行解过程性态分析,建立了系统状态的概率分布、均方和矩函数的数值汁箅公式,实现了该类系统数值模拟分析的完整算法和程序流程设计．最后,通过两类典型示例系统的数值仿真结粜验证本文算法与流程的正确性和有效性．     

Quantitative stochastic simulation of telecommunication networks in DESC+ +

DESC+ + (Discrete Event Simulation package using C+ +) has been developed as an object-oriented tool for quantitative simulation studies of communication protocols and architectures of telecommunication networks. The main issue of such performance studies is to secure proper statistical accuracy of the final simulation results. In DESC+ + this problem has been solved by automating analysis of simulation output data, aimed at stopping simulation when the estimates reach the required level of precision. The package consists of various object classes. While some of them are responsible for on-line output data analysis, others allow simulation programs of telecommunication networks to be easily developed by re-using existing (sub)models. We discuss main design and implementational issues of DESC+ +, and illustrate them by an example.     

自动化仓库输送调度问题的建模与控制研究

基于面向对象着色Petri网模型和时态逻辑方法,对自动化仓库输送系统运行过程的调度问题进行研究。建立了系统的面向对象着色Petri网模型,讨论了该过程的死锁分析问题,给出了系统行为的时态逻辑规范和死锁避免的最大允许反馈控制策略。     

Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait

Weighted Petri nets as a kind of formal language are widely used to model and verify discrete event systems related to resource allocation like flexible manufacturing systems. System of Simple Sequential Processes with Multi-Resources (S³PMR, a subclass of weighted Petri nets and an important extension to the well-known System of Simple Sequential Processes with Resources, can model many discrete event systems in which (1) multiple processes may run in parallel and (2) each execution step of each process may use multiple units from multiple resource types. This paper gives a necessary and sufficient condition for the liveness of S³PMR. A new structural concept called Structurally Circular Wait (SCW) is proposed for S³PMR. Blocking Marking (BM) associated with an SCW is defined. It is proven that a marked S³PMR is live if and only if each SCW has no BM. We use an example of multi-processor system-on-chip to show that SCW and BM can precisely characterise the (partial) deadlocks for S³PMR. Simultaneously, two examples are used to show the advantages of SCW in preventing deadlocks of S³PMR. These results are significant for the further research on dealing with the deadlock problem.     

On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets

A Petri net (PN) (Peterson, 1981; Reisig, 1985) is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. A free-choice Petri net FCPN) is a PN, where every arch from a place to a transition is either the unique output arc from that place or it is the unique input arc to the transition. Commoner's Liveness Theorem (cf. Hack, 1972, Ch. 4; Reisig, 1985, Section 7.2) states that a FCPN is live if and only if every siphon contains a marked trap at the initial marking. A siphon (trap) is a collection of places P such that . We concern ourselves with marking-dependent supervisory policies that can prevent the firing of a transition. We characterize supervisory policies that enforce liveness in non-live FCPNs using observations that strongly parallel Commoner's Liveness Theorem. We use this characterization to establish the existence of supervisory policies that enforce liveness in a Class of FCPNs called independent, increasing free-choice petri nets (II-FCPNs).     

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

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