On the public citation graph

Communication among relations

https://doi.org/10.1007/bfb0032040
0 signed · 33 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-15204-0_20openalex-snapshot
Semantics of concurrent systems: A modular fixed-point trace approach
inferredcites →https://doi.org/10.1007/3-540-51486-4_103openalex-snapshot
Concurrency, modularity, and synchronization
inferredcites →https://doi.org/10.1007/3-540-51486-4_60openalex-snapshot
Understanding nets
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf01786252openalex-snapshot
Semantics of finite and infinite networks of concurrent communicating agents
inferredcites →https://doi.org/10.1007/bfb0012771openalex-snapshot
An operational semantics for pure dataflow
inferredcites →https://doi.org/10.1007/bfb0013036openalex-snapshot
Nets of processes and data flow
inferredcites →https://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
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/0890-5401(89)90066-7openalex-snapshot
A proof of the Kahn principle for input/output automata
inferredcites →https://doi.org/10.1109/lics.1989.39171openalex-snapshot
Nets and data flow interpreters
inferredcites →https://doi.org/10.1145/3149.3155openalex-snapshot
A fixpoint semantics for nondeterministic data flow
inferredcites →https://doi.org/10.1145/3318.3480openalex-snapshot
Efficient demand-driven evaluation. Part 1
inferredcites →https://doi.org/10.1145/72981.72983openalex-snapshot
Equational reasoning about nondeterministic processes
inferredcites →https://doi.org/10.3233/fi-1988-11404openalex-snapshot
Behavior Structures and Nets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-54415-1_46openalex-snapshot
On nets, algebras and modularity
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-39910-0_7openalex-snapshot
A Functional Calculus for Specification and Verification of Nondeterministic Interactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_1openalex-snapshot
From Logic to Theoretical Computer Science – An Update
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_3openalex-snapshot
Boris A. Trakhtenbrot: Academic Genealogy and Publications
inferred← citeshttps://doi.org/10.1007/bfb0023892openalex-snapshot
Non modularity and expressibility for nets of relations (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0055651openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.1007/bfb0084812openalex-snapshot
Logic of trace languages
inferred← citeshttps://doi.org/10.1007/s002360050122openalex-snapshot
Modularity and expressibility for nets of relations
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90305-lopenalex-snapshot
Connectedness and synchronization
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.055openalex-snapshot
Event Structure Spans for Nondeterministic Dataflow
inferred← citeshttps://doi.org/10.1016/j.ic.2004.07.002openalex-snapshot
Turing machines, transition systems, and interaction
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00220-8openalex-snapshot
Turing Machines, Transition Systems, and Interaction
inferred← citeshttps://doi.org/10.1017/s0960129504004293openalex-snapshot
A relational model of non-deterministic dataflow
inferred← citeshttps://doi.org/10.3233/fi-1994-201238openalex-snapshot
COMPOSITIONAL PROOFS FOR NETWORKS OF PROCESSES
inferred← citeshttps://doi.org/10.3233/fi-1996-281212openalex-snapshot
On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity
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.