###
:2017.28(4):804-818

基于通信Petri网的异步通信程序验证模型
杨启哲,李国强
(上海交通大学 软件学院, 上海 200240)
Model on Asynchronous Communication Program Verification Based on Communicating Petri Nets
YANG Qi-Zhe,LI Guo-Qiang
(School of Software, Shanghai Jiaotong University, Shanghai 200240, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 1512   Download 1564
Received:May 27, 2016    Revised:November 26, 2016
> 中文摘要: 由于多栈的模型图灵等价,因此,通用的异步通信程序模型的验证问题不可判定.为此,基于Petri网,提出了一个新的模型通信——通信Petri网,对异步通信程序进行刻画.通过对输入通信进行k-型限制以及对每个栈进行基于正则语言泵引理的抽象,通过将这样限制下的模型编码到数据Petri网,证明了限制下的新模型可覆盖性可判定.
Abstract:Since multi-stack models are generally Turing-complete, verification problems on general models for asynchronous communication programs are undecidable. This paper proposes a new model based Petri net, named communication Petri nets (C-Petri nets) to model asynchronous communication programs. Applying the k-shaped restriction on the input communications and the abstraction on each stack based on popping lemma of regular languages, the coverability problem of the restricted C-Petri net is decidable by encoding the model to data Petri nets.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61672340,61472238,91318301) 国家自然科学基金(61672340,61472238,91318301)
Foundation items:National Natural Science Foundation of China (61672340, 61472238, 91318301)
Reference text:

杨启哲,李国强.基于通信Petri网的异步通信程序验证模型.软件学报,2017,28(4):804-818

YANG Qi-Zhe,LI Guo-Qiang.Model on Asynchronous Communication Program Verification Based on Communicating Petri Nets.Journal of Software,2017,28(4):804-818