On the public citation graph
An operational semantics for pure dataflow
0 signed · 40 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/bfb0022492openalex-snapshot
Formal description of programming concepts
inferredcites →https://doi.org/10.1051/ita/1981150201031openalex-snapshot
Sémantique des processus communicants
inferredcites →https://doi.org/10.1137/0114108openalex-snapshot
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
inferredcites →https://doi.org/10.1515/9781400882014-008openalex-snapshot
7. Infinite Games of Perfect Information
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.1996.0012openalex-snapshot
On Schematological Equivalence of Dataflow Networks
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-16442-1_18openalex-snapshot
Denotational semantics of nets with nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-17654-3_19openalex-snapshot
A formal semantics for a DataFlow Machine — Using VDM
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_22openalex-snapshot
Requirements on the Execution of Kahn Process Networks
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-61550-4_152openalex-snapshot
Linear dynamic Kahn networks are deterministic
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_10openalex-snapshot
A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-70210-6_18openalex-snapshot
Programming in Style with bach
inferred← citeshttps://doi.org/10.1007/978-3-319-91734-4_24openalex-snapshot
Kahn Process Networks and a Reactive Extension
inferred← citeshttps://doi.org/10.1007/978-3-642-10549-4_10openalex-snapshot
Automatic Synthesis and Deployment of Intensional Kahn Process Networks
inferred← citeshttps://doi.org/10.1007/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
inferred← citeshttps://doi.org/10.1007/bfb0033846openalex-snapshot
Semantics and compilation of recursive sequential streams in 81/2
inferred← citeshttps://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
inferred← citeshttps://doi.org/10.1007/bfb0055651openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1007/s11265-015-0971-yopenalex-snapshot
Tokens vs. Signals: On Conformance between Formal Models of Dataflow and Hardware
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90066-7openalex-snapshot
A proof of the Kahn principle for input/output automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80032-7openalex-snapshot
Functional behavior of nondeterministic and concurrent programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00156-4openalex-snapshot
Linear dynamic Kahn networks are deterministic
inferred← citeshttps://doi.org/10.1017/s0960129504004293openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1109/acsd.2019.00010openalex-snapshot
A Formal Semantics of Exposed Datapath Architectures with Buffered Processing Units
inferred← citeshttps://doi.org/10.1109/samos.2014.6893194openalex-snapshot
On tokens and signals: Bridging the semantic gap between dataflow models and hardware implementations
inferred← citeshttps://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferred← citeshttps://doi.org/10.1145/4472.4473openalex-snapshot
The denotational semantics of dynamic networks of processes
inferred← citeshttps://doi.org/10.1145/96709.96743openalex-snapshot
On the relations computable by a class of concurrent automata
inferred← citeshttps://doi.org/10.4204/eptcs.225.3openalex-snapshot
Compiling Process Networks to Interaction Nets
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.35openalex-snapshot
A Non-Standard Semantics for Kahn Networks in Continuous Time
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.