首页> 外文学位 >A transformation theory for Petri nets and their applications to manufacturing automation.
【24h】

A transformation theory for Petri nets and their applications to manufacturing automation.

机译:Petri网的转换理论及其在制造自动化中的应用。

获取原文
获取原文并翻译 | 示例

摘要

Design methods for automated manufacturing systems are investigated using Petri net theory. The methods presented in this thesis are based on the analysis of interactions between sub-systems. Four types of the interactions are identified: (1) common Transition-Transition-Path, (2) common Place-Place-Path, (3) common place (resource sharing), and (4) common transitions.;Transformation methods for generalized Petri nets are presented by introducing and using the concept of a live and bounded circuit (LB-circuit). The concepts of an arc ratio and a remainder are introduced. Also, a partially overlapping relation between two common paths is introduced. Using these concepts, it is shown that LB-circuits can be fused into a live and bounded net while preserving liveness and boundedness. Also, two live and bounded nets can be fused by a DEP;Synthesis methods for colored Petri nets are presented. The synthesized net guarantees the liveness and boundedness. Some restrictions for incidence functions and color sets are given. All synthesis lemmas and theorems for synthesizing generalized Petri nets are extended for colored Petri nets. A complex colored Petri net can be constructed using the methods.;Some interactions between sub-systems in manufacturing environments cannot be described by common paths. The interactions described by common transitions and a special case of a common place (resource sharing) are studied using the deviation bound and the shared resource net (SRN). A weighted deviation bound is introduced to solve the shared resource problems in generalized Petri nets. It is proven that the combined net of an SRN and LB-circuits is live and bounded. It is shown that an LB-circuit can be fused into the combined net composed of an SRN and LB-circuits while maintaining liveness and boundedness if the given conditions are satisfied. The initial conditions for liveness and boundedness can be found using the theorem presented in this thesis.;Colored Petri net models of information flows in a CIM system are presented. Three important sub-systems of CIM are considered, which are an MRP, a Process Planning, and a Shop Floor Control system. The required functionality of each sub-system is modeled using IDEF0. From these IDEF0 models, colored Petri net models are designed for analysis and control of information flows in a CIM system.;All synthesis methods presented in this thesis are illustrated by Petri net models for manufacturing automation.
机译:使用Petri网理论研究自动化制造系统的设计方法。本文提出的方法是基于子系统之间相互作用的分析。确定了四种类型的交互:(1)常见的Transition-Transition-Path,(2)常见的Place-Place-Path,(3)常见的场所(资源共享),以及(4)常见的转变。通过引入和使用带电和有界电路(LB电路)的概念来介绍Petri网。介绍了电弧比和余数的概念。另外,引入了两个公共路径之间的部分重叠的关系。使用这些概念,表明可以将LB电路融合到有电和有界网络中,同时保留活动性和有界性。同样,可以通过DEP融合两个有界和有界的网;提出了有色Petri网的合成方法。合成的网保证了活泼和有界。给出了对入射函数和颜色集的一些限制。所有用于合成广义Petri网的合成引理和定理都扩展到有色Petri网。可以使用这些方法来构建复杂的彩色Petri网。制造环境中子系统之间的某些交互无法通过通用路径来描述。使用偏差界限和共享资源网(SRN)研究了由公共转变和公共场所的特殊情况(资源共享)描述的交互。为了解决广义Petri网中的共享资源问题,引入了加权偏差界。事实证明,SRN和LB电路的组合网络是有界的。结果表明,如果满足给定条件,则可以将LB电路融合到由SRN和LB电路组成的组合网络中,同时保持活动性和有界性。利用本文提出的定理可以找到活跃性和有界性的初始条件。提出了CIM系统中信息流的彩色Petri网模型。考虑了CIM的三个重要子系统,它们是MRP,过程计划和车间控制系统。每个子系统的必需功能都使用IDEF0进行建模。从这些IDEF0模型中,设计了彩色Petri网模型来分析和控制CIM系统中的信息流。本文中提出的所有综合方法均由Petri网模型说明,用于制造自动化。

著录项

  • 作者

    Koh, Inseon.;

  • 作者单位

    Rensselaer Polytechnic Institute.;

  • 授予单位 Rensselaer Polytechnic Institute.;
  • 学科 Engineering Electronics and Electrical.;Engineering System Science.;Computer Science.
  • 学位 Ph.D.
  • 年度 1991
  • 页码 190 p.
  • 总页数 190
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号