Petri网的合流性及其应用

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI:10.1109/SYNASC.2006.71

I. Leahu, F. Ţiplea

{"title":"Petri网的合流性及其应用","authors":"I. Leahu, F. Ţiplea","doi":"10.1109/SYNASC.2006.71","DOIUrl":null,"url":null,"abstract":"A Petri net is confluent if its firing relation is confluent, i.e., for any two reachable markings there exists a marking reachable from both of them. We prove that confluence is a decidable property for Petri nets and it is preserved by asynchronous parallel composition. Applications to Petri net structural transformations and term rewriting systems are then pointed out","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"The Confluence Property for Petri Nets and its Applications\",\"authors\":\"I. Leahu, F. Ţiplea\",\"doi\":\"10.1109/SYNASC.2006.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Petri net is confluent if its firing relation is confluent, i.e., for any two reachable markings there exists a marking reachable from both of them. We prove that confluence is a decidable property for Petri nets and it is preserved by asynchronous parallel composition. Applications to Petri net structural transformations and term rewriting systems are then pointed out\",\"PeriodicalId\":309740,\"journal\":{\"name\":\"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2006.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

如果一个Petri网的发射关系是合流的，则该网是合流的，即对于任意两个可达标记，都存在一个可达标记。证明了Petri网的合流性是一个可判定的性质，并通过异步并行组合保持了合流性。然后指出了在Petri网结构变换和项重写系统中的应用

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

查看原文本刊更多论文

The Confluence Property for Petri Nets and its Applications

A Petri net is confluent if its firing relation is confluent, i.e., for any two reachable markings there exists a marking reachable from both of them. We prove that confluence is a decidable property for Petri nets and it is preserved by asynchronous parallel composition. Applications to Petri net structural transformations and term rewriting systems are then pointed out

求助全文

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

来源期刊

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量