On the public citation graph
A fully abstract trace model for dataflow and asynchronous networks
0 signed · 56 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/3-540-15670-4_23openalex-snapshot
Semantics of networks containing indeterminate operators
inferredcites →https://doi.org/10.1007/3-540-15670-4_9openalex-snapshot
The pomset model of parallel processes: Unifying the temporal and the spatial
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-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
inferredcites →https://doi.org/10.1007/3-540-51285-3_43openalex-snapshot
Comparing two fully abstract dataflow models
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferredcites →https://doi.org/10.1007/bf01660035openalex-snapshot
Semantics of digital networks containing indeterminate modules
inferredcites →https://doi.org/10.1007/bf01843567openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1007/bfb0020836openalex-snapshot
Compositionality, Concurrency and Partial Correctness
inferredcites →https://doi.org/10.1007/bfb0029628openalex-snapshot
A hierarchy of compositional models of I/O-automata (Extended Abstract)
inferredcites →https://doi.org/10.1016/0011-684x(85)90108-xopenalex-snapshot
Communicating sequential processes
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/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(82)90021-4openalex-snapshot
Proposition de semantique denotationnelle pour des reseaux de processus avec operateur de melange equitable
inferredcites →https://doi.org/10.1016/0304-3975(83)90017-8openalex-snapshot
Computing the behaviour of asynchronous processes
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(85)90130-6openalex-snapshot
On the suitability of trace semantics for modular proofs of communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(86)90040-xopenalex-snapshot
A theory for nondeterminism, parallelism, communication, and concurrency
inferredcites →https://doi.org/10.1109/sfcs.1989.63474openalex-snapshot
Full abstraction for nondeterministic dataflow networks
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/3149.3155openalex-snapshot
A fixpoint semantics for nondeterministic data flow
inferredcites →https://doi.org/10.1145/323596.323601openalex-snapshot
A model and proof system for asynchronous networks
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/512760.512783openalex-snapshot
A straightforward denotational semantics for non-determinate data flow programs
inferredcites →https://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/96709.96742openalex-snapshot
On oraclizable networks and Kahn's principle
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.1998.2738openalex-snapshot
A Fully Abstract Semantics for Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1006/inco.2000.2886openalex-snapshot
Strong Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_17openalex-snapshot
A Compositional Model for Confluent Dynamic Data-Flow Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_4openalex-snapshot
Quantitative Analysis of Interval Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-98047-8_6openalex-snapshot
Compositional Semantics for Concurrent Object Groups in ABS
inferred← citeshttps://doi.org/10.1007/978-3-642-40615-7_3openalex-snapshot
Verification of Open Concurrent Object Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_17openalex-snapshot
Feedback in Synchronous Relational Interfaces
inferred← citeshttps://doi.org/10.1007/s11265-015-0971-yopenalex-snapshot
Tokens vs. Signals: On Conformance between Formal Models of Dataflow and Hardware
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.007openalex-snapshot
Infinite trace equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.069openalex-snapshot
Infinite Trace Equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.087openalex-snapshot
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
inferred← citeshttps://doi.org/10.1016/j.jss.2018.12.016openalex-snapshot
Continuously analyzing finite, message-driven, time-synchronous component & connector systems during architecture evolution
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/s1571-0661(05)80154-9openalex-snapshot
A Framework for Fair Communicating Processes
inferred← citeshttps://doi.org/10.1080/00207169708804599openalex-snapshot
Network algebra for asynchronous dataflow∗
inferred← citeshttps://doi.org/10.1109/icsa.2017.34openalex-snapshot
Semantic Differencing for Message-Driven Component & Connector Architectures
inferred← citeshttps://doi.org/10.1109/samos.2014.6893194openalex-snapshot
On tokens and signals: Bridging the semantic gap between dataflow models and hardware implementations
inferred← citeshttps://doi.org/10.1145/1795194.1795223openalex-snapshot
Compositionality in Synchronous Data Flow
inferred← citeshttps://doi.org/10.1145/2442116.2442133openalex-snapshot
Compositionality in synchronous data flow
inferred← citeshttps://doi.org/10.1145/2933575.2934503openalex-snapshot
Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
inferred← citeshttps://doi.org/10.1145/3088525.3088527openalex-snapshot
A computational model for TensorFlow: an introduction
inferred← citeshttps://doi.org/10.23919/fruct.2012.8122100openalex-snapshot
Mechanism for robust dataflow operation on smart spaces
inferred← citeshttps://doi.org/10.23940/ijpe.20.02.p10.265283openalex-snapshot
Repeatedly Coding Inter-Packet Delay for Tracking Down Network Attacks
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.