过渡系统的积与Petri网的补充

2016 16th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2016-06-22 DOI:10.1109/ACSD.2016.10

Raymond R. Devillers

{"title":"过渡系统的积与Petri网的补充","authors":"Raymond R. Devillers","doi":"10.1109/ACSD.2016.10","DOIUrl":null,"url":null,"abstract":"It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine when and how a transition system may be decomposed in non-trivial concurrent factors, and extend the theory to more general labelled transition systems. Meanwhile, we shall develop interesting algebraic properties of disjoint products.","PeriodicalId":334903,"journal":{"name":"2016 16th International Conference on Application of Concurrency to System Design (ACSD)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Products of Transition Systems and Additions of Petri Nets\",\"authors\":\"Raymond R. Devillers\",\"doi\":\"10.1109/ACSD.2016.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine when and how a transition system may be decomposed in non-trivial concurrent factors, and extend the theory to more general labelled transition systems. Meanwhile, we shall develop interesting algebraic properties of disjoint products.\",\"PeriodicalId\":334903,\"journal\":{\"name\":\"2016 16th International Conference on Application of Concurrency to System Design (ACSD)\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 16th International Conference on Application of Concurrency to System Design (ACSD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2016.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 16th International Conference on Application of Concurrency to System Design (ACSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2016.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

众所周知，不相交Petri网和的可达图是各分量的可达图的不相交积。我们将在这里考虑相反的问题，即确定过渡系统何时以及如何分解为非平凡的并发因子，并将理论推广到更一般的标记过渡系统。同时，我们将发展不相交积的有趣的代数性质。

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

查看原文本刊更多论文

Products of Transition Systems and Additions of Petri Nets

It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine when and how a transition system may be decomposed in non-trivial concurrent factors, and extend the theory to more general labelled transition systems. Meanwhile, we shall develop interesting algebraic properties of disjoint products.

求助全文

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

来源期刊

2016 16th International Conference on Application of Concurrency to System Design (ACSD)

自引率

0.00%

发文量