TP311

Model and Method for Verifying Asynchronous Program Based on Communication-free Petri Net
Author:
Affiliation:

Fund Project:

• 摘要
• |
• 图/表
• |
• 访问统计
• |
• 参考文献
• |
• 相似文献
• |
• 引证文献
• |
• 资源附件
• |
• 文章评论
摘要:

异步程序使用异步非阻塞调用方式来实现程序的并发, 被广泛应用于并行与分布式系统中. 验证异步程序复杂性很高, 无论是安全性还是活性均达到EXPSPACE难. 提出一个异步程序的程序模型系统, 并在其上定义了两个异步程序上的问题: $\epsilon$等价性问题和$\epsilon$可达性问题. 通过将3-CNF-SAT规约到这两个问题, 再将其规约至非交互式Petri网的可达性证明两个问题是NP完备的. 案例表明, 这两个问题可以解决异步程序上一系列的程序验证问题.

Abstract:

Asynchronous programs utilize asynchronous non-blocking calls to achieve program concurrency, and they are widely applied in parallel and distributed systems. However, it is very complex to verify asynchronous programs, and the difficulty can be ranked as EXPSPACE in terms of both safety and liveness. This study proposes a program model of asynchronous programs and defines two problems of asynchronous programs, namely, ?-equivalence and ?-reachability. In addition, the two problems can be proved to be NP-complete by reducing the 3-CNF-SAT to the problems and making them further reduced to the reachability of the communication-free Petri net. The case shows that the two problems can solve the verification problems of asynchronous programs.

参考文献
相似文献
引证文献

• 点击次数:
• 下载次数:
• HTML阅读次数:
历史
• 收稿日期:2021-09-03
• 最后修改日期:2021-10-14
• 录用日期:
• 在线发布日期: 2022-03-24
• 出版日期: