{"title":"有数据的 Petri 网中的双向可达性","authors":"Łukasz Kamiński, Sławomir Lasota","doi":"arxiv-2405.16176","DOIUrl":null,"url":null,"abstract":"We investigate Petri nets with data, an extension of plain Petri nets where\ntokens carry values from an infinite data domain, and executability of\ntransitions is conditioned by equalities between data values. We provide a\ndecision procedure for the bi-reachability problem: given a Petri net and its\ntwo configurations, we ask if each of the configurations is reachable from the\nother. This pushes forward the decidability borderline, as the bi-reachability\nproblem subsumes the coverability problem (which is known to be decidable) and\nis subsumed by the reachability problem (whose decidability status is unknown).","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"66 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bi-reachability in Petri nets with data\",\"authors\":\"Łukasz Kamiński, Sławomir Lasota\",\"doi\":\"arxiv-2405.16176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate Petri nets with data, an extension of plain Petri nets where\\ntokens carry values from an infinite data domain, and executability of\\ntransitions is conditioned by equalities between data values. We provide a\\ndecision procedure for the bi-reachability problem: given a Petri net and its\\ntwo configurations, we ask if each of the configurations is reachable from the\\nother. This pushes forward the decidability borderline, as the bi-reachability\\nproblem subsumes the coverability problem (which is known to be decidable) and\\nis subsumed by the reachability problem (whose decidability status is unknown).\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"66 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.16176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.16176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们研究了带数据的 Petri 网，它是普通 Petri 网的扩展，其中的标记携带无限数据域中的值，且过渡的可执行性以数据值之间的相等为条件。我们提供了双可达性问题的判定过程：给定一个 Petri 网和它的两个配置，我们问每个配置是否都可以从另一个配置到达。这就推进了可判定性的边界，因为双可达性问题包含了可覆盖性问题（已知可判定）和可达性问题（其可判定性状况未知）。
We investigate Petri nets with data, an extension of plain Petri nets where
tokens carry values from an infinite data domain, and executability of
transitions is conditioned by equalities between data values. We provide a
decision procedure for the bi-reachability problem: given a Petri net and its
two configurations, we ask if each of the configurations is reachable from the
other. This pushes forward the decidability borderline, as the bi-reachability
problem subsumes the coverability problem (which is known to be decidable) and
is subsumed by the reachability problem (whose decidability status is unknown).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
