时间谓词转换网络及其应用

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI:10.1109/CMPSAC.1990.139364

Xudong He

{"title":"时间谓词转换网络及其应用","authors":"Xudong He","doi":"10.1109/CMPSAC.1990.139364","DOIUrl":null,"url":null,"abstract":"A new class of high-level Petri nets is defined, which is a combination of predicate transition nets and first order temporal logic. By combining these two formal methods, one can explicitly specify the structures and specify and verify various properties of parallel and distributed systems in the same framework, which cannot be achieved by using either one of the formal methods individually. Therefore, a more powerful methodology for the specification and the verification of parallel and distributed systems is obtained. The application of temporal predicate transition nets is illustrated through the specification and the verification of the five-dining-philosophers problem.<<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":"5","resultStr":"{\"title\":\"Temporal predicate transition nets and their applications\",\"authors\":\"Xudong He\",\"doi\":\"10.1109/CMPSAC.1990.139364\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new class of high-level Petri nets is defined, which is a combination of predicate transition nets and first order temporal logic. By combining these two formal methods, one can explicitly specify the structures and specify and verify various properties of parallel and distributed systems in the same framework, which cannot be achieved by using either one of the formal methods individually. Therefore, a more powerful methodology for the specification and the verification of parallel and distributed systems is obtained. The application of temporal predicate transition nets is illustrated through the specification and the verification of the five-dining-philosophers problem.<<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\":\"5\",\"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.139364\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1990.139364","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

定义了一类新的高级Petri网，它是谓词转换网和一阶时间逻辑的结合。通过结合这两种形式化方法，可以显式地指定结构，并在同一框架中指定和验证并行和分布式系统的各种属性，这是单独使用任何一种形式化方法都无法实现的。因此，为并行和分布式系统的规范和验证提供了一种更有力的方法。通过对五餐哲学家问题的说明和验证，说明了时间谓词转换网的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Temporal predicate transition nets and their applications

A new class of high-level Petri nets is defined, which is a combination of predicate transition nets and first order temporal logic. By combining these two formal methods, one can explicitly specify the structures and specify and verify various properties of parallel and distributed systems in the same framework, which cannot be achieved by using either one of the formal methods individually. Therefore, a more powerful methodology for the specification and the verification of parallel and distributed systems is obtained. The application of temporal predicate transition nets is illustrated through the specification and the verification of the five-dining-philosophers problem.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings., Fourteenth Annual International Computer Software and Applications Conference

自引率

0.00%

发文量