逻辑开发的Petri网死锁分析程序

Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92 Pub Date : 1992-11-10 DOI:10.1109/TAI.1992.246407

D. Cooke

{"title":"逻辑开发的Petri网死锁分析程序","authors":"D. Cooke","doi":"10.1109/TAI.1992.246407","DOIUrl":null,"url":null,"abstract":"If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"270 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Logical development of a Petri net deadlock analysis program\",\"authors\":\"D. Cooke\",\"doi\":\"10.1109/TAI.1992.246407\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness.<<ETX>>\",\"PeriodicalId\":265283,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"volume\":\"270 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1992.246407\",\"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 Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果将结构良好的并发程序表示为Petri网，则可以分析网络中的死锁。所谓结构良好的并发程序是指其嵌套级别遵循结构化编程原则的程序。将结构良好的并发程序定义为Pefri网，给出了一个分析Petri网死锁的Prolog程序，并证明该程序真正实现了程序活跃性的规范。

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

查看原文本刊更多论文

Logical development of a Petri net deadlock analysis program

If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness.<>

求助全文

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

来源期刊

Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92

自引率

0.00%

发文量