On the public citation graph

Compositional relational semantics for indeterminate dataflow networks

https://doi.org/10.1007/bfb0018344
0 signed · 38 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-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-19488-6_133openalex-snapshot
Computations, residuals, and the power of indeterminacy
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bfb0012771openalex-snapshot
An operational semantics for pure dataflow
inferredcites →https://doi.org/10.1007/bfb0040254openalex-snapshot
Connections between a concrete and an abstract model of concurrent systems
inferredcites →https://doi.org/10.1016/0167-6423(88)90016-0openalex-snapshot
Nondeterministic data flow programs: How to avoid the merge anomaly
inferredcites →https://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferredcites →https://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferredcites →https://doi.org/10.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1109/proc.1977.10647openalex-snapshot
Information processing
inferredcites →https://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks

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.0039openalex-snapshot
Aperiodic Languages in Concurrency Monoids
inferred← citeshttps://doi.org/10.1006/inco.1998.2752openalex-snapshot
Context-Free Event Domains Are Recognizable
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_11openalex-snapshot
On Concurrent Realization of Reactive Systems and Their Morphisms
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_27openalex-snapshot
Trace Nets
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_111openalex-snapshot
From domains to automata with concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_84openalex-snapshot
A kleene theorem for recognizable languages over concurrency monoids
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_55openalex-snapshot
Context-free event domains are recognizable
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_41openalex-snapshot
Languages and logical definability in concurrency monoids
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_19openalex-snapshot
A Semantics for Relational Programming
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/bfb0013470openalex-snapshot
Dataflow networks are fibrations
inferred← citeshttps://doi.org/10.1007/bfb0032032openalex-snapshot
Concurrency, automata and domains
inferred← citeshttps://doi.org/10.1007/bfb0040254openalex-snapshot
Connections between a concrete and an abstract model of concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0055650openalex-snapshot
Fibrational semantics of dataflow networks
inferred← citeshttps://doi.org/10.1007/bfb0055651openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1007/bfb0084799openalex-snapshot
Structural operational specifications and trace automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00030-1openalex-snapshot
Labelled domains and automata with concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00266-lopenalex-snapshot
Recognizable languages in concurrency monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00012-6openalex-snapshot
Representation of computations in concurrent automata by dependence orders
inferred← citeshttps://doi.org/10.1017/s0960129504004293openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1109/lics.1992.185527openalex-snapshot
A calculus of dataflow networks
inferred← citeshttps://doi.org/10.1142/s021819679800017xopenalex-snapshot
Topology for Computations of Concurrent Automata
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/96709.96743openalex-snapshot
On the relations computable by a class of concurrent automata
inferred← citeshttps://doi.org/10.3233/fi-1995-22128openalex-snapshot
AN ALGEBRA OF 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.