On the public citation graph

On the analysis of cooperation and antagonism in networks of communicating processes

https://doi.org/10.1007/bf01762125
0 signed · 23 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/bf00263928openalex-snapshot
Complexity of analyzing the synchronization structure of concurrent programs
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferredcites →https://doi.org/10.1016/0020-0190(85)90033-xopenalex-snapshot
Exposure to deadlock for communicating processes is hard to detect
inferredcites →https://doi.org/10.1016/0022-0000(80)90033-1openalex-snapshot
The complexity of problems in systems of communicating sequential processes
inferredcites →https://doi.org/10.1109/tc.1982.1676079openalex-snapshot
A Theory for Protocol Validation
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/800135.804422openalex-snapshot
Universal games of incomplete information
inferredcites →https://doi.org/10.1145/800221.806724openalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_6openalex-snapshot
A Tool for the Performance Analysis of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_7openalex-snapshot
Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bf01189855openalex-snapshot
Complexity analysis of propositional concurrent programs using domino tiling
inferred← citeshttps://doi.org/10.1007/bfb0015435openalex-snapshot
Deciding bisimulation and trace equivalences for systems with many identical processes
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00176-4openalex-snapshot
Deciding bisimulation and trace equivalences for systems with many identical processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)80714-6openalex-snapshot
Deciding bisimulation and trace equivalences for systems with many identical processes
inferred← citeshttps://doi.org/10.1109/hicss.1993.284103openalex-snapshot
Complexity analysis of propositional concurrent programs using domino tiling
inferred← citeshttps://doi.org/10.1145/778348.778359openalex-snapshot
From CTL to datalog
inferred← citeshttps://doi.org/10.4271/2016-01-0035openalex-snapshot
Simplifying the Review of Communicating Finite State Machines Implementation using Static Analysis
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.