On transforming Petri net model to Moore machine

Carl K. Chang, Hsuanwei Huang
{"title":"On transforming Petri net model to Moore machine","authors":"Carl K. Chang, Hsuanwei Huang","doi":"10.1109/CMPSAC.1990.139365","DOIUrl":null,"url":null,"abstract":"The absence of satisfactory methods for verifying the liveness and fairness properties limits the analysis power of Petri net theories. An approach is introduced to connect the Petri net model with the Model Checker. A translator is used to transform the reachability graph of the Petri net to the Moore machine. The Moore machine and the behaviors specified by temporal logic are the inputs of the Model Checker, which is able to verify the properties of liveness and fairness. During the transformation, local and global behaviors of the Petri net model are separated, which means that a certain modularity can be achieved. An optimization technique is presented to trim the unnecessary local information from the local reachability graphs. The space complexity of manipulating the global reachability graph, which is generated by combing the trimmed local reachability graph, can be reduced. Moreover, a new approach is proposed to verify the concurrency behavior by using the Model Checker.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1990.139365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The absence of satisfactory methods for verifying the liveness and fairness properties limits the analysis power of Petri net theories. An approach is introduced to connect the Petri net model with the Model Checker. A translator is used to transform the reachability graph of the Petri net to the Moore machine. The Moore machine and the behaviors specified by temporal logic are the inputs of the Model Checker, which is able to verify the properties of liveness and fairness. During the transformation, local and global behaviors of the Petri net model are separated, which means that a certain modularity can be achieved. An optimization technique is presented to trim the unnecessary local information from the local reachability graphs. The space complexity of manipulating the global reachability graph, which is generated by combing the trimmed local reachability graph, can be reduced. Moreover, a new approach is proposed to verify the concurrency behavior by using the Model Checker.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Petri网模型向摩尔机的转换
由于缺乏令人满意的方法来验证Petri网的活动性和公平性,限制了Petri网理论的分析能力。介绍了一种将Petri网模型与模型检查器连接起来的方法。利用翻译器将Petri网的可达性图转换为摩尔机。摩尔机和时间逻辑指定的行为是模型检查器的输入,模型检查器能够验证活动性和公平性。在转换过程中,将Petri网模型的局部行为与全局行为分离,实现了一定的模块化。提出了一种从局部可达图中剔除不必要的局部信息的优化技术。通过对裁剪后的局部可达图进行梳理生成全局可达图,可以降低操作全局可达图的空间复杂度。此外,提出了一种利用模型检查器验证并发行为的新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Compiling linear recursive Prolog programs with list structure into procedural language PPK: a method for recording and analyzing software design processes Concurrent transaction execution in multidatabase systems An application of object-oriented design for communication control systems The analysis of infeasible concurrent paths of concurrent Ada programs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1