论准备集与覆盖步骤相结合的方法

Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI:10.1504/IJCCBS.2014.059591

H. Boucheneb, Kamel Barkaoui

{"title":"论准备集与覆盖步骤相结合的方法","authors":"H. Boucheneb, Kamel Barkaoui","doi":"10.1504/IJCCBS.2014.059591","DOIUrl":null,"url":null,"abstract":"We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets. It establishes some sufficient conditions useful to construct covering steps graphs preserving LTL","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On combining the ready sets with the covering steps methods\",\"authors\":\"H. Boucheneb, Kamel Barkaoui\",\"doi\":\"10.1504/IJCCBS.2014.059591\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets. It establishes some sufficient conditions useful to construct covering steps graphs preserving LTL\",\"PeriodicalId\":210749,\"journal\":{\"name\":\"Int. J. Crit. Comput. Based Syst.\",\"volume\":\"190 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Crit. Comput. Based Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJCCBS.2014.059591\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Crit. Comput. Based Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJCCBS.2014.059591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们在这里考虑时间Petri网和由Vernadat等人提出的覆盖步骤图技术。在此技术中，将一些转换放在一起，在单个转换步骤中触发。本文探讨了如何将该技术推广应用于时间Petri网。给出了构造保LTL覆盖阶图的充分条件

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

查看原文本刊更多论文

On combining the ready sets with the covering steps methods

We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets. It establishes some sufficient conditions useful to construct covering steps graphs preserving LTL

求助全文

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

来源期刊

Int. J. Crit. Comput. Based Syst.

自引率

0.00%

发文量