Bi-reachability in Petri nets with data
Computation and Language
2024-07-12 v2 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
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).
Keywords
Cite
@article{arxiv.2405.16176,
title = {Bi-reachability in Petri nets with data},
author = {Łukasz Kamiński and Sławomir Lasota},
journal= {arXiv preprint arXiv:2405.16176},
year = {2024}
}