On the public citation graph

Stability and sequentiality in dataflow networks

https://doi.org/10.1007/bfb0032041
0 signed · 35 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-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferredcites →https://doi.org/10.1007/3-540-17906-2_30openalex-snapshot
Trace theory
inferredcites →https://doi.org/10.1007/3-540-18088-5openalex-snapshot
Automata, Languages and Programming
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/bf01887206openalex-snapshot
Event fairness and non-interleaving concurrency
inferredcites →https://doi.org/10.1007/bfb0032041openalex-snapshot
Stability and sequentiality in dataflow networks
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/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
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/0890-5401(89)90066-7openalex-snapshot
A proof of the Kahn principle for input/output automata
inferredcites →https://doi.org/10.1016/s0304-3975(82)80002-9openalex-snapshot
Sequential algorithms on concrete data structures
inferredcites →https://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferredcites →https://doi.org/10.1145/96709.96743openalex-snapshot
On the relations computable by a class of concurrent automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11601548_23openalex-snapshot
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_47openalex-snapshot
Towards a complete hierarchy of compositional dataflow models
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_97openalex-snapshot
Dependence orders for computations of concurrent automata
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/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_20openalex-snapshot
From Sequential Specifications to Eventual Consistency
inferred← citeshttps://doi.org/10.1007/bf00122082openalex-snapshot
On the models for asynchronous circuit behaviour with OR causality
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90089-copenalex-snapshot
Historical introduction to “concrete domains” by G. Kahn and G.D. Plotkin
inferred← citeshttps://doi.org/10.1016/j.ic.2004.07.002openalex-snapshot
Turing machines, transition systems, and interaction
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.016openalex-snapshot
Asynchronous games 2: The true concurrency of innocence
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.1016/s1571-0661(04)00220-8openalex-snapshot
Turing Machines, Transition Systems, and Interaction
inferred← citeshttps://doi.org/10.1109/lics.1998.705665openalex-snapshot
A stability theorem in rewriting theory
inferred← citeshttps://doi.org/10.1109/lics.2005.6openalex-snapshot
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21954openalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1142/s0129054198000192openalex-snapshot
RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
inferred← citeshttps://doi.org/10.1142/s021819679800017xopenalex-snapshot
Topology for Computations of Concurrent Automata
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:4)2020openalex-snapshot
Directed Homotopy in Non-Positively Curved Spaces
showing the first 18 of 19 · page through all 19
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.