On the public citation graph

The expressive power of indeterminate primitives in asynchronous computation

https://doi.org/10.1007/3-540-60692-0_45
0 signed · 46 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-10007-5_47openalex-snapshot
On the semantics of fair parallelism
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-16442-1_18openalex-snapshot
Denotational semantics of nets with nondeterminism
inferredcites →https://doi.org/10.1007/3-540-17906-2_30openalex-snapshot
Trace theory
inferredcites →https://doi.org/10.1007/3-540-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
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/3-540-50517-2_90openalex-snapshot
McCarthy's amb cannot implement fair merge
inferredcites →https://doi.org/10.1007/978-1-4471-3860-0_10openalex-snapshot
A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
inferredcites →https://doi.org/10.1007/978-1-4612-4886-6openalex-snapshot
Fairness
inferredcites →https://doi.org/10.1007/bf01178582openalex-snapshot
The expressive power of delay operators in SCCS
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf01744297openalex-snapshot
Formal computations of non deterministic recursive program schemes
inferredcites →https://doi.org/10.1007/bfb0012771openalex-snapshot
An operational semantics for pure dataflow
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferredcites →https://doi.org/10.1007/bfb0013036openalex-snapshot
Nets of processes and data flow
inferredcites →https://doi.org/10.1007/bfb0032040openalex-snapshot
Communication among relations
inferredcites →https://doi.org/10.1007/bfb0032041openalex-snapshot
Stability and sequentiality in dataflow networks
inferredcites →https://doi.org/10.1007/bfb0036893openalex-snapshot
On semantic foundations for applicative multiprogramming
inferredcites →https://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous 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/0022-0000(93)90034-topenalex-snapshot
Nonexpressibility of fairness and signaling
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/0890-5401(92)90043-fopenalex-snapshot
The expressive power of indeterminate dataflow primitives
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0304-3975(96)00234-4openalex-snapshot
Degrees of parallelism in the continuous type hierarchy
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1989.39171openalex-snapshot
Nets and data flow interpreters
inferredcites →https://doi.org/10.1109/sfcs.1989.63474openalex-snapshot
Full abstraction for nondeterministic dataflow networks
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
inferredcites →https://doi.org/10.1145/75277.75291openalex-snapshot
A fully abstract trace model for dataflow networks
inferredcites →https://doi.org/10.1145/96709.96742openalex-snapshot
On oraclizable networks and Kahn's principle
inferredcites →https://doi.org/10.2307/2185110openalex-snapshot
The | lambda-Calculus.
inferredcites →https://doi.org/10.5860/choice.30-5049openalex-snapshot
Semantics of programming languages: structures and techniques

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4133086openalex-extracted
Polychronous Model and Kahn Process Networks
inferred← citeshttps://doi.org/10.1007/bfb0055651openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.04.011openalex-snapshot
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00247-xopenalex-snapshot
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80311-1openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
inferred← citeshttps://doi.org/10.1017/s0960129504004293openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1109/asap.2003.1212825openalex-snapshot
Context-aware process networks
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1145/292540.292558openalex-snapshot
Stochastic processes as concurrent constraint programs
inferred← citeshttps://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
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.