AbstractCellular resource driven automata nets (CRDA-nets) are a generalization of the concept of two-level resource nets (Petri ne'/> On the Spatial Boundedness of Cellular RDA-nets
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Automatic Control and Computer Sciences >On the Spatial Boundedness of Cellular RDA-nets
【24h】

On the Spatial Boundedness of Cellular RDA-nets

机译：关于细胞RDA网的空间界性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

AbstractCellular resource driven automata nets (CRDA-nets) are a generalization of the concept of two-level resource nets (Petri nets) with an introduction of an infinite regular system grid. This formalism is a hybrid of Petri nets and asynchronous Cellular Automata and is designed for modeling multi-agent systems with dynamic spatial structure. Spatial boundedness is a property that guarantees the preservation of the finiteness of “geometric dimensions” of the active part of the system (for example, the living space) during its lifetime. Three variants of spatial boundedness for cellular RDA-nets are defined: localization, bounded diameter and bounded area. The properties of the corresponding algorithmic problems are investigated, their undecidability in the general case is proved. A non-trivial criterion for the localization of an one-dimensional CRDA-net is proposed, based on the new concept of the RDA propagation graph. An algorithm is described for constructing a propagation graph, using the method of saturation of generating paths. A method for estimating the diameter of an 1-dim CRDA with a bounded propagation graph is presented.]]>
机译： ]]>

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号