具有上下文无关结构变化的Petri网分析

Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-09-06 DOI:10.14279/tuj.eceasst.71.1003

Nils Erik Flick, Björn Engelmann

{"title":"具有上下文无关结构变化的Petri网分析","authors":"Nils Erik Flick, Björn Engelmann","doi":"10.14279/tuj.eceasst.71.1003","DOIUrl":null,"url":null,"abstract":"Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Petri Nets with Context-Free Structure Changes\",\"authors\":\"Nils Erik Flick, Björn Engelmann\",\"doi\":\"10.14279/tuj.eceasst.71.1003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.\",\"PeriodicalId\":115235,\"journal\":{\"name\":\"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14279/tuj.eceasst.71.1003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14279/tuj.eceasst.71.1003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

结构变化Petri网是具有过渡替换规则的Petri网。在本文中，我们研究了限制类的结构变化工作流网络，并证明了标记触发序列语言中的两种不同的可达性属性(具体可达性和抽象可达性)和词隶属度是可确定的，而基于语言的正确性概念(标记触发序列语言在正则语言中的包含)是不可确定的。

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

查看原文本刊更多论文

Analysis of Petri Nets with Context-Free Structure Changes

Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.

求助全文

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

来源期刊

Electron. Commun. Eur. Assoc. Softw. Sci. Technol.

自引率

0.00%

发文量