首页> 外文会议>International Conference in Application and Theory of Petri Nets and Concurrency >Abstraction-Based Incremental Inductive Coverability for Petri Nets
【24h】

Abstraction-Based Incremental Inductive Coverability for Petri Nets

机译:基于抽象的增量电感覆盖性培养网

获取原文
获取外文期刊封面目录资料

摘要

We present a novel approach to check the coverability problem of Petri nets which is based on a tight integration of IC3 with place-merge abstraction. Place-merge abstraction can reduce the dimensionality of state spaces by trying to merge some places that may be not critical for proving the property. In this scenario, IC3 runs only on abstract Petri nets with lower dimensionality. When the current abstraction allows for a spurious counterexample, it is refined by splitting candidate abstract places. Furthermore, this can be done in a completely incremental way without discarding results found in previous abstractions. The experimental evaluation on the standard Petri net benchmarks shows the effectiveness and competitiveness of our approach.
机译:我们介绍了一种新的方法来检查Petri网的覆盖性问题,这是基于IC3与地点抽象的紧密集成。 Place-Merge抽象可以通过尝试合并某些可能不关键来证明属性的地方来降低状态空间的维度。 在这种情况下,IC3仅在较低维度的抽象Petri网上运行。 当前抽象允许虚假的反例时,它通过拆分候选抽象场所来改进。 此外,这可以以完全增量的方式进行,而不会丢弃先前抽象中的结果。 标准Petri网络基准测试的实验评估显示了我们方法的有效性和竞争力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号