On the public citation graph

Decidability questions for fairness in Petri nets

https://doi.org/10.1007/bfb0039622
0 signed · 27 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-15204-0_6openalex-snapshot
Infinite behaviour and fairness in petri nets
inferredcites →https://doi.org/10.1007/bf00289715openalex-snapshot
The residue of vector sets with applications to decidability problems in Petri nets
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
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.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-51486-4_72openalex-snapshot
System simulation and the sensitivity of self-stabilization
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_14openalex-snapshot
Exhibition of a Structural Bug with Wings
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_18openalex-snapshot
Covering Fairness against Conspiracies
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_37openalex-snapshot
Termination Problems in Chemical Kinetics
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_5openalex-snapshot
Structural Counter Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_20openalex-snapshot
Channel Properties of Asynchronously Composed Petri Nets
inferred← citeshttps://doi.org/10.1007/bf00264283openalex-snapshot
The instability of self-stabilization
inferred← citeshttps://doi.org/10.1007/bf02090765openalex-snapshot
Communicating processes, scheduling, and the complexity of nontermination
inferred← citeshttps://doi.org/10.1007/bfb0017158openalex-snapshot
A taxonomy of fairness and temporal logic problems for petri nets
inferred← citeshttps://doi.org/10.1007/bfb0029006openalex-snapshot
Decidability of weak fairness in petri nets
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/0304-3975(90)90006-4openalex-snapshot
Decidability of a temporal logic problem for Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90206-hopenalex-snapshot
Global and local views of state fairness
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferred← citeshttps://doi.org/10.1023/a:1008224000619openalex-snapshot
On Supervisory Policies that Enforce Global Fairness and Bounded Fairness in Partially Controlled Petri Nets
inferred← citeshttps://doi.org/10.1080/00207168908803692openalex-snapshot
Boundedness, hierarchy of fairness, and communication networks with delay
inferred← citeshttps://doi.org/10.1145/3434325openalex-snapshot
Context-bounded verification of liveness properties for multithreaded shared-memory programs
inferred← citeshttps://doi.org/10.3233/fi-2015-1245openalex-snapshot
Catching a Structural Bug with a Flower
inferred← citeshttps://doi.org/10.70675/ca78c9eaz034dz4fefzbd5bz0d2137ea8d47openalex-snapshot
Vérification relationnelle pour des programmes avec des données entières
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
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.