【24h】

Readability of Production Recipes

机译:生产食谱的可读性

获取原文

摘要

There is a rising demand for customised products with a high degree of complexity. To meet these demands, manufacturing lines are increasingly becoming autonomous, networked, and intelligent, with production lines being virtualised into a manufacturing cloud, and advertised either internally to a company, or externally in a public cloud. In this paper, we present a novel approach to two key problems in such future manufacturing systems: the realisability problem (whether a product can be manufactured by a set of manufacturing resources) and the control problem (how a particular product should be manufactured). We show how both production recipes specifying the steps necessary to manufacture a particular product, and manufacturing resources and their topology can be formalised as labelled transition systems, and define a novel simulation relation which captures what it means for a recipe to be realisable on a production topology. We show how a controller that can orchestrate the resources in order to manufacture the product on the topology can be extracted from the simulation relation, and give an algorithm to compute a simulation relation and a controller.
机译:具有高度复杂性的定制产品的需求上升。为了满足这些要求,制造业越来越多地成为自主,网络和智能化,生产线虚拟化到制造云中,并在内部向公司或外部宣传。在本文中,我们在这种未来的制造系统中提出了一种新的两个关键问题的方法:可实现的问题(是否可以通过一组制造资源制造产品)和控制问题(如何制造特定产品)。我们展示了如何将两种生产配方指定制造特定产品所需的步骤以及制造资源及其拓扑结构,可以正式地作为标记的过渡系统形式化,并定义一种新的仿真关系,该关系捕获了在生产中可实现的配方意味着什么拓扑。我们展示了如何从仿真关系中提取要在拓扑上制造拓扑上的产品的控制器如何进行协调,并给出一种计算模拟关系和控制器的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号