On the public citation graph
Decidability of reachability in persistent vector replacement systems
0 signed · 25 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-7091-8596-4_6openalex-snapshot
On the Reachability Problem for Persistent Vector Replacement Systems
inferredcites →https://doi.org/10.1016/0304-3975(76)90008-6openalex-snapshot
The equality problem for vector addition systems is undecidable
inferredcites →https://doi.org/10.1016/0304-3975(77)90014-7openalex-snapshot
Complexity of some problems in Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(78)90036-1openalex-snapshot
The covering and boundedness problems for vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/0378-4754(79)90040-5openalex-snapshot
An introduction to the general theory of algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1145/322077.322079openalex-snapshot
Properties of Conflict-Free and Persistent Petri Nets
inferredcites →https://doi.org/10.1145/800105.803396openalex-snapshot
The decidability of the reachability problem for vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.1145/800119.803908openalex-snapshot
A partial solution to the reachability-problem for vector-addition systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_46openalex-snapshot
An algorithm to identify slices, with applications to vector replacement systems
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_19openalex-snapshot
Recent results on the complexity of problems related to Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_44openalex-snapshot
Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems
inferred← citeshttps://doi.org/10.1007/978-3-642-69968-9_6openalex-snapshot
Nets Consisting of Places and Transistions
inferred← citeshttps://doi.org/10.1007/978-3-642-71275-3_6openalex-snapshot
Netze aus Stellen und Transitionen
inferred← citeshttps://doi.org/10.1007/978-3-642-95457-3_4openalex-snapshot
Netze aus Stellen und Transitionen
inferred← citeshttps://doi.org/10.1007/bf00289268openalex-snapshot
Persistence of vector replacement systems is decidable
inferred← citeshttps://doi.org/10.1007/bfb0039619openalex-snapshot
On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states
inferred← citeshttps://doi.org/10.1007/bfb0042308openalex-snapshot
Analysis and control of discrete event systems represented by petri nets
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90117-4openalex-snapshot
On weak persistency of petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90026-5openalex-snapshot
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90059-oopenalex-snapshot
A unified approach for deciding the existence of certain petri net paths
inferred← citeshttps://doi.org/10.1142/s0129054109006759openalex-snapshot
PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
inferred← citeshttps://doi.org/10.1145/800076.802477openalex-snapshot
An algorithm for the general Petri net reachability problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.