On the public citation graph

Nets of processes and data flow

https://doi.org/10.1007/bfb0013036
0 signed · 21 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-07854-1_168openalex-snapshot
Recursive program schemes and computable functionals
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bfb0012771openalex-snapshot
An operational semantics for pure dataflow
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.3233/fi-1988-11404openalex-snapshot
Behavior Structures and Nets

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.1997.2658openalex-snapshot
On Schematological Equivalence of Partially Interpreted Dataflow Networks
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_60openalex-snapshot
Understanding nets
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_46openalex-snapshot
On nets, algebras and modularity
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_13openalex-snapshot
On a technology of design and analysis of dataflow programs
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_1openalex-snapshot
From Logic to Theoretical Computer Science – An Update
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_3openalex-snapshot
Boris A. Trakhtenbrot: Academic Genealogy and Publications
inferred← citeshttps://doi.org/10.1007/bf01178383openalex-snapshot
A Petri nets semantics for data flow networks
inferred← citeshttps://doi.org/10.1007/bf02280834openalex-snapshot
A fully abstract trace model for dataflow and asynchronous networks
inferred← citeshttps://doi.org/10.1007/bfb0023846openalex-snapshot
Arithmetic + logic + geometry = concurrency
inferred← citeshttps://doi.org/10.1007/bfb0032040openalex-snapshot
Communication among relations
inferred← citeshttps://doi.org/10.1007/bfb0055651openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90305-lopenalex-snapshot
Connectedness and synchronization
inferred← citeshttps://doi.org/10.1109/lics.1989.39171openalex-snapshot
Nets and data flow interpreters
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63474openalex-snapshot
Full abstraction for nondeterministic dataflow networks
inferred← citeshttps://doi.org/10.7146/brics.v4i36.18962openalex-snapshot
Relational Semantics of Non-Deterministic Dataflow
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.