首页> 外文会议>Transactions on petri nets and other models of concurrency V. >Computing a Hierarchical Static Order for Decision Diagram-Based Representation from P/T Nets
【24h】

Computing a Hierarchical Static Order for Decision Diagram-Based Representation from P/T Nets

机译:从P / T网络计算基于决策图的表示的分层静态订单

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

摘要

State space generation suffers from the typical combinatorial explosion problem when dealing with industrial specifications. In particular, memory consumption while storing the state space must be tackled to verify safety properties. Decision Diagrams are a way to tackle this problem. However, their performance strongly rely on the way variables encode a system. Another way to fight combinatorial explosion is to hierarchically encode the state space of a system. This paper presents how we mix the two techniques via the hierarchization of a precomputed variable order. This way we obtain a hierarchical static order for the variables encoding a system. This heuristic was implemented and exhibits good performance.
机译:在处理工业规范时,状态空间的生成会遇到典型的组合爆炸问题。特别是,必须解决存储状态空间时的内存消耗以验证安全性。决策图是解决此问题的一种方法。但是,它们的性能很大程度上取决于变量对系统进行编码的方式。对抗组合爆炸的另一种方法是对系统的状态空间进行分层编码。本文介绍了如何通过预计算变量阶的分层将两种技术混合在一起。这样,我们为编码系统的变量获得了分层的静态顺序。实施了这种启发式方法,并表现出良好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号