On the public citation graph

Infinite behaviour of deterministic petri nets

https://doi.org/10.1007/bfb0017144
0 signed · 19 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/978-3-642-68353-4_34openalex-snapshot
Deterministic Languages of Petri Nets
inferredcites →https://doi.org/10.1007/bf01691063openalex-snapshot
Decision problems forω-automata
inferredcites →https://doi.org/10.1007/bfb0039620openalex-snapshot
Closure properties of deterministic Petri nets
inferredcites →https://doi.org/10.1016/0022-0000(78)90019-3openalex-snapshot
ω-Computations on deterministic pushdown machines
inferredcites →https://doi.org/10.1016/0304-3975(83)90115-9openalex-snapshot
Infinite behaviour of Petri nets
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0022-0000(77)80004-4openalex-snapshot
Theory of ω-languagesI: Characterizations of ω-context-free 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.1007/978-3-030-51831-8_4openalex-snapshot
On the High Complexity of Petri Nets $$\omega $$-Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_13openalex-snapshot
The Wadge Hierarchy of Petri Nets ω-Languages
inferred← citeshttps://doi.org/10.1007/bfb0035767openalex-snapshot
Automata with storage on infinite words
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90349-xopenalex-snapshot
X-automata on ω-words
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.12.007openalex-snapshot
On the topological complexity of ω-languages of non-deterministic Petri nets
inferred← citeshttps://doi.org/10.1515/9781614518044openalex-snapshot
Logic, Computation, Hierarchies
inferred← citeshttps://doi.org/10.3233/fi-2021-2088openalex-snapshot
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words
inferred← citeshttps://doi.org/10.4230/lipicsopenalex-snapshot
Wadge Degrees of $\omega$-Languages of Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6835openalex-snapshot
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1712.07945openalex-snapshot
Wadge Degrees of $ω$-Languages of 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.