自由选择系统的多项式阶分解算法

Proceedings of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93) Pub Date : 1993-09-27 DOI:10.1109/ETFA.1993.396411

T. Nishimura, D. Lee, S. Kumagai

{"title":"自由选择系统的多项式阶分解算法","authors":"T. Nishimura, D. Lee, S. Kumagai","doi":"10.1109/ETFA.1993.396411","DOIUrl":null,"url":null,"abstract":"An O(m/sup 2/n/sup 2/) algorithm to find an S-decomposition of a live and bounded free choice (LSFC) net or (live and safe free choice) (LBFC) net is obtained. A polynomial order algorithm to find a T-decomposition can be constructed easily based on the algorithm. An O(m/sup 2/n/sup 2/+mn/sup 3/) algorithm to find an LSFC net is proposed. Many analysis problems of concurrent systems modeled by free choice net can be solved efficiently based on the proposed algorithms.<<ETX>>","PeriodicalId":239174,"journal":{"name":"Proceedings of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial order decomposition algorithms for free choice systems\",\"authors\":\"T. Nishimura, D. Lee, S. Kumagai\",\"doi\":\"10.1109/ETFA.1993.396411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An O(m/sup 2/n/sup 2/) algorithm to find an S-decomposition of a live and bounded free choice (LSFC) net or (live and safe free choice) (LBFC) net is obtained. A polynomial order algorithm to find a T-decomposition can be constructed easily based on the algorithm. An O(m/sup 2/n/sup 2/+mn/sup 3/) algorithm to find an LSFC net is proposed. Many analysis problems of concurrent systems modeled by free choice net can be solved efficiently based on the proposed algorithms.<<ETX>>\",\"PeriodicalId\":239174,\"journal\":{\"name\":\"Proceedings of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.1993.396411\",\"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 of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.1993.396411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

给出了一种O(m/sup 2/n/sup 2/)算法来求活有界自由选择(LSFC)网或活安全自由选择(LBFC)网的s分解。在此基础上，可以很容易地构造一个多项式阶t分解算法。提出了一种求LSFC网络的O(m/sup 2/n/sup 2/+mn/sup 3/)算法。本文提出的算法可以有效地解决许多由自由选择网建模的并发系统的分析问题

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

查看原文本刊更多论文

Polynomial order decomposition algorithms for free choice systems

An O(m/sup 2/n/sup 2/) algorithm to find an S-decomposition of a live and bounded free choice (LSFC) net or (live and safe free choice) (LBFC) net is obtained. A polynomial order algorithm to find a T-decomposition can be constructed easily based on the algorithm. An O(m/sup 2/n/sup 2/+mn/sup 3/) algorithm to find an LSFC net is proposed. Many analysis problems of concurrent systems modeled by free choice net can be solved efficiently based on the proposed algorithms.<>

求助全文

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

来源期刊

Proceedings of IEEE 2nd International Workshop on Emerging Technologies and Factory Automation (ETFA '93)

自引率

0.00%

发文量