On the public citation graph

A relational model of non-deterministic dataflow

https://doi.org/10.1007/bfb0055651
0 signed · 64 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.1006/aima.1997.1649openalex-snapshot
Monoidal Bicategories and Hopf Algebroids
inferredcites →https://doi.org/10.1006/inco.1996.0057openalex-snapshot
Bisimulation from Open Maps
inferredcites →https://doi.org/10.1007/3-540-06859-7_145openalex-snapshot
First version of a data flow procedure language
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-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-54345-7_47openalex-snapshot
Models for concurrency
inferredcites →https://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferredcites →https://doi.org/10.1007/3-540-61604-7_44openalex-snapshot
Retracing some paths in process algebra
inferredcites →https://doi.org/10.1007/3-540-62688-3_37openalex-snapshot
Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi
inferredcites →https://doi.org/10.1007/3-540-63141-0_26openalex-snapshot
First-order axioms for asynchrony
inferredcites →https://doi.org/10.1007/3-540-63172-0_32openalex-snapshot
Presheaf models for concurrency
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-642-59126-6openalex-snapshot
Handbook of Formal Languages
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_8openalex-snapshot
Partial Commutation and Traces
inferredcites →https://doi.org/10.1007/978-3-642-61455-2_10openalex-snapshot
Interaction Categories and the Foundations of Typed Concurrent Programming
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
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/bfb0013470openalex-snapshot
Dataflow networks are fibrations
inferredcites →https://doi.org/10.1007/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
inferredcites →https://doi.org/10.1007/bfb0032040openalex-snapshot
Communication among relations
inferredcites →https://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
inferredcites →https://doi.org/10.1007/bfb0055650openalex-snapshot
Fibrational semantics of dataflow networks
inferredcites →https://doi.org/10.1016/0168-0072(94)90069-8openalex-snapshot
A completeness theorem for open maps
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/s0019-9958(76)90390-9openalex-snapshot
Feedback and generalized logic
inferredcites →https://doi.org/10.1016/s0022-4049(96)00012-6openalex-snapshot
Bicategories of processes
inferredcites →https://doi.org/10.1016/s0304-3975(01)00209-2openalex-snapshot
Presheaf models for CCS-like languages
inferredcites →https://doi.org/10.1016/s1571-0661(04)80073-2openalex-snapshot
Categorical Structure of Asynchrony
inferredcites →https://doi.org/10.1017/cbo9780511525858openalex-snapshot
Handbook of Categorical Algebra
inferredcites →https://doi.org/10.1017/s0305004100074338openalex-snapshot
Traced monoidal categories
inferredcites →https://doi.org/10.1090/dimacs/029/08openalex-snapshot
Presheaves as transition systems
inferredcites →https://doi.org/10.1090/s0273-0979-1985-15304-2openalex-snapshot
A polynomial invariant for knots via von Neumann algebras
inferredcites →https://doi.org/10.1109/lics.1989.39171openalex-snapshot
Nets and data flow interpreters
inferredcites →https://doi.org/10.1109/lics.1992.185527openalex-snapshot
A calculus of dataflow networks
inferredcites →https://doi.org/10.1145/3149.3155openalex-snapshot
A fixpoint semantics for nondeterministic data flow
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/75277.75291openalex-snapshot
A fully abstract trace model for dataflow networks
inferredcites →https://doi.org/10.4135/9781483332222.n157openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.7146/brics.v2i39.19941openalex-snapshot
Petri Nets, Traces, and Local Model Checking
inferredcites →https://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay

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-65306-6_23openalex-snapshot
Petri nets and other models of concurrency
inferred← citeshttps://doi.org/10.1007/bfb0055650openalex-snapshot
Fibrational semantics of dataflow networks
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.entcs.2015.12.005openalex-snapshot
Open Maps in Concrete Categories and Branching Bisimulation for Prefix Orders
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.029openalex-snapshot
Domain theory for concurrency
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00088-6openalex-snapshot
Erratic Fudgets: a semantic theory for an embedded coordination language
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00209-2openalex-snapshot
Presheaf models for CCS-like languages
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/s0960129505004718openalex-snapshot
Profunctors, open maps and bisimulation
inferred← citeshttps://doi.org/10.1109/lics.1999.782590openalex-snapshot
Weak bisimulation and open maps
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00047openalex-snapshot
Effectful Mealy Machines: Bisimulation and Trace
inferred← citeshttps://doi.org/10.1145/1863597.1863607openalex-snapshot
Arrows are strong monads
inferred← citeshttps://doi.org/10.1145/3531130.3533365openalex-snapshot
Monoidal Streams for Dataflow Programming
inferred← citeshttps://doi.org/10.2977/prims/1145475500openalex-snapshot
The Uniformity Principle on Traced Monoidal Categories
inferred← citeshttps://doi.org/10.48550/arxiv.1406.6035openalex-snapshot
Refinement Calculus of Reactive Systems
inferred← citeshttps://doi.org/10.7146/brics.v10i43.21815openalex-snapshot
Domain Theory for Concurrency
inferred← citeshttps://doi.org/10.7146/brics.v11i22.21847openalex-snapshot
Profunctors, Open Maps and Bisimulation
inferred← citeshttps://doi.org/10.7146/brics.v6i14.20071openalex-snapshot
Weak Bisimulation and Open Maps
inferred← citeshttps://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
inferred← citeshttps://doi.org/10.7146/brics.v6i36.20105openalex-snapshot
Presheaf Models for CCS-like Languages
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.