确定时间加权标记图的周期时间计算

1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467) Pub Date : 1999-10-18 DOI:10.1109/ETFA.1999.813105

M. Nakamura, M. Silva

{"title":"确定时间加权标记图的周期时间计算","authors":"M. Nakamura, M. Silva","doi":"10.1109/ETFA.1999.813105","DOIUrl":null,"url":null,"abstract":"This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Cycle time computation in deterministically timed weighted marked graphs\",\"authors\":\"M. Nakamura, M. Silva\",\"doi\":\"10.1109/ETFA.1999.813105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.\",\"PeriodicalId\":119106,\"journal\":{\"name\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.1999.813105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.1999.813105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

研究了无限服务器语义下确定性定时加权标记图的最小周期时间计算问题。提出了一种由活的有界WMG系统转换为活的有界WMG系统的方法，该方法保留了非定时行为(用Petri网语言表示)和最小周期时间。将已知的LPP应用于变换后的MG系统，可以精确地计算出MCT。我们的方法的计算复杂度是关于原始WMG的基本t -半流的大小X的多项式。

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

查看原文本刊更多论文

Cycle time computation in deterministically timed weighted marked graphs

This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.

求助全文

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

来源期刊

1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)

自引率

0.00%

发文量