On the public citation graph

Linear time algorithms for liveness and boundedness in conflict-free Petri nets

https://doi.org/10.1007/bfb0023812
0 signed · 32 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18086-9_19openalex-snapshot
Recent results on the complexity of problems related to Petri nets
inferredcites →https://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
inferredcites →https://doi.org/10.1007/3-540-50580-6_30openalex-snapshot
On questions of fairness and temporal logic for conflict-free Petri nets
inferredcites →https://doi.org/10.1007/978-3-540-47919-2_16openalex-snapshot
Complexity of Place / Transition Nets
inferredcites →https://doi.org/10.1007/978-3-642-69968-9openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1016/0004-3702(77)90014-5openalex-snapshot
Directed recursive labelnode hypergraphs: A new representation-language
inferredcites →https://doi.org/10.1016/0020-0190(75)90020-4openalex-snapshot
A decidability theorem for a class of vector-addition systems
inferredcites →https://doi.org/10.1016/0020-0190(87)90089-5openalex-snapshot
An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems
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(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferredcites →https://doi.org/10.1016/0304-3975(90)90030-lopenalex-snapshot
Dynamic maintenance of directed hypergraphs
inferredcites →https://doi.org/10.1016/0743-1066(91)90006-bopenalex-snapshot
On-line algorithms for polynomially solvable satisfiability problems
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1145/2157.322404openalex-snapshot
Graph Algorithms for Functional Dependency Manipulation
inferredcites →https://doi.org/10.1145/322077.322079openalex-snapshot
Properties of Conflict-Free and Persistent Petri Nets
inferredcites →https://doi.org/10.1145/356698.356702openalex-snapshot
Petri Nets

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-45446-2_20openalex-snapshot
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_55openalex-snapshot
Petri nets, hypergraphs and conflicts (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_64openalex-snapshot
A unified approach for reasoning about conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_14openalex-snapshot
Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_6openalex-snapshot
A Polynomial Algorithm to Compute the Concurrency Relation of a Regular STG
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_40openalex-snapshot
Complexity of Linear Connectivity Problems in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_37openalex-snapshot
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02679458openalex-snapshot
Deciding a Class of Path Formulas for Conflict-Free Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0055754openalex-snapshot
Hypergraph traversal revisited: Cost measures and dynamic algorithms
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.005openalex-snapshot
Partially dynamic maintenance of minimum weight hyperpaths
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.038openalex-snapshot
Linear connectivity problems in directed hypergraphs
inferred← citeshttps://doi.org/10.1109/rndm64105.2024.10820429openalex-snapshot
Higher-Order Graph Models in Network Security
inferred← citeshttps://doi.org/10.3233/fi-2015-1170openalex-snapshot
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
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.