{"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}
引用次数: 5
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
