涉及时间的人工智能任务构造的Petri网模型的推导

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference Pub Date : 1989-09-20 DOI:10.1109/CMPSAC.1989.65050

F. Fong, S. Shatz

{"title":"涉及时间的人工智能任务构造的Petri网模型的推导","authors":"F. Fong, S. Shatz","doi":"10.1109/CMPSAC.1989.65050","DOIUrl":null,"url":null,"abstract":"Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. Timed and conditional entry call models that shed light on determining implementable interpretations are presented. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Derivation of Petri net models of Ada tasking constructs involving time\",\"authors\":\"F. Fong, S. Shatz\",\"doi\":\"10.1109/CMPSAC.1989.65050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. Timed and conditional entry call models that shed light on determining implementable interpretations are presented. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.<<ETX>>\",\"PeriodicalId\":339677,\"journal\":{\"name\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1989.65050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1989.65050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

采用定时Petri网对涉及时间的人工智能任务结构进行建模。这种建模有助于解释Ada参考手册中描述的(通常)模棱两可的语义。提出了确定可实现解释的定时和条件输入调用模型。从一般的选择性等待模型出发，展示了如何应用Petri网约简运算来推导其他选择性等待模型。

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

查看原文本刊更多论文

Derivation of Petri net models of Ada tasking constructs involving time

Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. Timed and conditional entry call models that shed light on determining implementable interpretations are presented. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.<>

求助全文

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

来源期刊

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference

自引率

0.00%

发文量