杨启哲,李国强.基于通信Petri网的异步通信程序验证模型.软件学报,2017,28(4):804-818 |
基于通信Petri网的异步通信程序验证模型 |
Model on Asynchronous Communication Program Verification Based on Communicating Petri Nets |
投稿时间:2016-05-27 修订日期:2016-11-26 |
DOI:10.13328/j.cnki.jos.005191 |
中文关键词: 异步通信程序 通信Petri网 可覆盖性 程序验证 k-型 |
英文关键词:asynchronous communication program communication Petri net coverability program verification k-shaped |
基金项目:国家自然科学基金(61672340,61472238,91318301) |
|
摘要点击次数: 2619 |
全文下载次数: 2363 |
中文摘要: |
由于多栈的模型图灵等价,因此,通用的异步通信程序模型的验证问题不可判定.为此,基于Petri网,提出了一个新的模型通信——通信Petri网,对异步通信程序进行刻画.通过对输入通信进行k-型限制以及对每个栈进行基于正则语言泵引理的抽象,通过将这样限制下的模型编码到数据Petri网,证明了限制下的新模型可覆盖性可判定. |
英文摘要: |
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. |
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |