形状良好的彩色网中的一种结构颜色简化

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91 Pub Date : 1991-12-02 DOI:10.1109/PNPM.1991.238773

G. Chiola, G. Franceschinis

{"title":"形状良好的彩色网中的一种结构颜色简化","authors":"G. Chiola, G. Franceschinis","doi":"10.1109/PNPM.1991.238773","DOIUrl":null,"url":null,"abstract":"Well-formed coloured Petri nets (WN) have been recently defined as a new formalism that allows the automatic identification of model symmetries by means of the construction of the symbolic reachability graph (SRG). The authors define a sufficient structural condition for the simplification of the colour structure of the net that can exploit symmetries not detectable with the SRG. The simplified WNs may have reduced SRG and in any case are easier to analyze by means of the SRG technique.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"A structural colour simplification in well-formed coloured nets\",\"authors\":\"G. Chiola, G. Franceschinis\",\"doi\":\"10.1109/PNPM.1991.238773\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Well-formed coloured Petri nets (WN) have been recently defined as a new formalism that allows the automatic identification of model symmetries by means of the construction of the symbolic reachability graph (SRG). The authors define a sufficient structural condition for the simplification of the colour structure of the net that can exploit symmetries not detectable with the SRG. The simplified WNs may have reduced SRG and in any case are easier to analyze by means of the SRG technique.<<ETX>>\",\"PeriodicalId\":137470,\"journal\":{\"name\":\"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1991.238773\",\"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 the Fourth International Workshop on Petri Nets and Performance Models PNPM91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1991.238773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 30

摘要

格式良好的彩色Petri网(WN)最近被定义为一种新的形式主义，它允许通过构建符号可达图(SRG)来自动识别模型对称性。作者定义了一个充分的结构条件来简化网的颜色结构，可以利用SRG无法检测到的对称性。简化的WNs可能减少了SRG，并且在任何情况下都更容易通过SRG技术进行分析。

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

查看原文本刊更多论文

A structural colour simplification in well-formed coloured nets

Well-formed coloured Petri nets (WN) have been recently defined as a new formalism that allows the automatic identification of model symmetries by means of the construction of the symbolic reachability graph (SRG). The authors define a sufficient structural condition for the simplification of the colour structure of the net that can exploit symmetries not detectable with the SRG. The simplified WNs may have reduced SRG and in any case are easier to analyze by means of the SRG technique.<>

求助全文

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

来源期刊

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91

自引率

0.00%

发文量