On the public citation graph
Semantics of digital networks containing indeterminate modules
0 signed · 29 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/3-540-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_16openalex-snapshot
A Fixed Point Approach to Applicative Multiprogramming
inferredcites →https://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/bfb0036893openalex-snapshot
On semantic foundations for applicative multiprogramming
inferredcites →https://doi.org/10.1016/0096-0551(79)90008-0openalex-snapshot
An approach to software system behavior description
inferredcites →https://doi.org/10.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/mcd.1985.6311967openalex-snapshot
Silicon compilation based on a data-flow paradigm
inferredcites →https://doi.org/10.1145/1344551.1344561openalex-snapshot
Closure properties of interconnections of determinate systems
inferredcites →https://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
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.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_90openalex-snapshot
McCarthy's amb cannot implement fair merge
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_43openalex-snapshot
Comparing two fully abstract dataflow models
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/978-3-319-06880-0_6openalex-snapshot
(Co)Algebraic Characterizations of Signal Flow Graphs
inferred← citeshttps://doi.org/10.1007/bf01784888openalex-snapshot
An operator net model for distributed systems
inferred← citeshttps://doi.org/10.1007/bf01888222openalex-snapshot
Equational reasoning about nondeterministic processes
inferred← citeshttps://doi.org/10.1007/bf02280834openalex-snapshot
A fully abstract trace model for dataflow and asynchronous networks
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90034-topenalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90043-fopenalex-snapshot
The expressive power of indeterminate dataflow primitives
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114106openalex-snapshot
Specification and verification of concurrent systems by causality and realizability
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00322-9openalex-snapshot
The algebra of stream processing functions
inferred← citeshttps://doi.org/10.1109/lics.1993.287596openalex-snapshot
Full abstraction for a shared variable parallel language
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21954openalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1145/3672085openalex-snapshot
A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems
inferred← citeshttps://doi.org/10.1145/62546.62585openalex-snapshot
Process semantics: universal axioms compositional rules, and applications
inferred← citeshttps://doi.org/10.1145/96709.96742openalex-snapshot
On oraclizable networks and Kahn's principle
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.