On the public citation graph
Persistence of vector replacement systems is decidable
0 signed · 80 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/3-540-07135-0_113openalex-snapshot
A fundamental theorem of asynchronous parallel computation
inferredcites →https://doi.org/10.1007/bfb0022522openalex-snapshot
Decidability of reachability in persistent vector replacement systems
inferredcites →https://doi.org/10.1016/0022-0000(78)90021-1openalex-snapshot
A 222pn upper bound on the complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1016/0304-3975(77)90059-7openalex-snapshot
Decidable problems on the strong connectivity of Petri net reachability sets
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/sfcs.1975.27openalex-snapshot
Synchronization and computing capabilities of linear asynchronous structures
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/322077.322079openalex-snapshot
Properties of Conflict-Free and Persistent Petri Nets
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1993.1055openalex-snapshot
Completeness Results for Single-Path Petri Nets
inferred← citeshttps://doi.org/10.1007/11527800_18openalex-snapshot
P Systems: Some Recent Results and Research Problems
inferred← citeshttps://doi.org/10.1007/11562948_36openalex-snapshot
Flat Counter Automata Almost Everywhere!
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_21openalex-snapshot
The reachability problem for VAS
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/3-540-45294-x_28openalex-snapshot
Rewrite Closure for Ground and Cancellative AC Theories
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_43openalex-snapshot
Recognizable Sets of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_30openalex-snapshot
On questions of fairness and temporal logic for conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_22openalex-snapshot
Normal and sinkless Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_25openalex-snapshot
Behavioural equivalence for infinite systems — Partially decidable!
inferred← citeshttps://doi.org/10.1007/978-3-030-21290-2_13openalex-snapshot
Information Systems Modeling: Language, Verification, and Tool Support
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_12openalex-snapshot
The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_18openalex-snapshot
The Power of Maximal Parallelism in P Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_42openalex-snapshot
Characterizations of Catalytic Membrane Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_15openalex-snapshot
Language Theory of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_16openalex-snapshot
Complexity of Place / Transition Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_26openalex-snapshot
Reversal-Bounded Counter Machines Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_27openalex-snapshot
Programmability of Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_7openalex-snapshot
On Yen’s Path Logic for Petri Nets
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/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.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferred← citeshttps://doi.org/10.1007/s11047-010-9180-6openalex-snapshot
Petri nets for modelling metabolic pathways: a survey
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90117-4openalex-snapshot
On weak persistency of petri nets
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90004-2openalex-snapshot
The complexity of problems involving structurally bounded and conservative Petri nets
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90013-xopenalex-snapshot
Completeness results for conflict-free vector replacement systems
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90046-yopenalex-snapshot
Normal and sinkless 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/0304-3975(89)90053-4openalex-snapshot
Problems concerning fairness and temporal logic for conflict-free petri nets
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.1016/j.ic.2012.11.004openalex-snapshot
On persistent reachability in Petri nets
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.002openalex-snapshot
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.028openalex-snapshot
Catalytic P systems, semilinear sets, and vector addition systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.051openalex-snapshot
Verification of membrane systems with delays via Petri nets with delays
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.007openalex-snapshot
Equivalence between model-checking flat counter systems and Presburger arithmetic
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.011openalex-snapshot
Verifying chemical reaction network implementations: A pathway decomposition approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.013openalex-snapshot
Local time membrane systems and time Petri nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00183-9openalex-snapshot
Program schemes, arrays, Lindström quantifiers and zero-one laws
inferred← citeshttps://doi.org/10.1017/s0960129509990181openalex-snapshot
Deciding reachability problems in Turing-complete fragments of Mobile Ambients
inferred← citeshttps://doi.org/10.1023/a:1008969621405openalex-snapshot
A Petri Net Model for Hardware/Software Codesign
inferred← citeshttps://doi.org/10.1049/cth2.12546openalex-snapshot
A symbolic approach to the verification and enforcement of current‐state opacity using labelled Petri nets
inferred← citeshttps://doi.org/10.1080/00029890.1985.11971721openalex-snapshot
A Combinatorial Theorem on Circulant Matrices
inferred← citeshttps://doi.org/10.1089/cmb.2024.0521openalex-snapshot
Pathway Realizability in Chemical Networks
inferred← citeshttps://doi.org/10.1109/iwrsp.1997.618823openalex-snapshot
Computing communication cost by Petri nets for hardware/software codesign
inferred← citeshttps://doi.org/10.1109/tac.2016.2574120openalex-snapshot
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
inferred← citeshttps://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferred← citeshttps://doi.org/10.1142/s0129054105003236openalex-snapshot
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0129054105003340openalex-snapshot
ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
inferred← citeshttps://doi.org/10.1142/s0129054109006759openalex-snapshot
PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
inferred← citeshttps://doi.org/10.1142/s0129054111008428openalex-snapshot
ON YEN'S PATH LOGIC FOR PETRI NETS
inferred← citeshttps://doi.org/10.1145/800076.802477openalex-snapshot
An algorithm for the general Petri net reachability problem
inferred← citeshttps://doi.org/10.3103/s0146411611070091openalex-snapshot
On the reachability set of automaton counter machines
inferred← citeshttps://doi.org/10.3233/fi-2009-0086openalex-snapshot
Levels of Persistency in Place/Transition Nets
inferred← citeshttps://doi.org/10.3233/fi-2018-1663openalex-snapshot
A Petri Net Based Modeling of Active Objects and Futures
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01952openalex-snapshot
Hierarchy of persistence with respect to the length of action's disability
inferred← citeshttps://doi.org/10.70675/99300c67z5e8az4a0dzb050z2995f5490c67openalex-snapshot
Data centric workflows for crowdsourcing application
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
inferred← citeshttps://doi.org/10.7146/brics.v2i55.19956openalex-snapshot
Behavioural Equivalence for Infinite Systems—Partially Decidable!
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.