On the public citation graph

Graph notation for concurrent combinators

https://doi.org/10.1007/bfb0026581
0 signed · 38 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/3-540-55719-9_114openalex-snapshot
Barbed bisimulation
inferredcites →https://doi.org/10.1007/3-540-57163-9_6openalex-snapshot
An action structure for synchronous π-calculus
inferredcites →https://doi.org/10.1007/3-540-57208-2_10openalex-snapshot
A theory of bisimulation for the π-calculus
inferredcites →https://doi.org/10.1007/3-540-57208-2_12openalex-snapshot
A pi-calculus semantics for an object-based design notation
inferredcites →https://doi.org/10.1007/3-540-57529-4_70openalex-snapshot
On reduction-based process semantics
inferredcites →https://doi.org/10.1007/3-540-57887-0_125openalex-snapshot
Replication in concurrent combinators
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1017/s0960129500001407openalex-snapshot
Functions as processes
inferredcites →https://doi.org/10.1145/143165.143172openalex-snapshot
The geometry of optimal lambda reduction
inferredcites →https://doi.org/10.1145/174675.177953openalex-snapshot
Combinatory representation of mobile processes
inferredcites →https://doi.org/10.1145/322154.322167openalex-snapshot
Flowgraphs and Flow Algebras
inferredcites →https://doi.org/10.1145/75277.75290openalex-snapshot
A calculus of higher order communicating systems
inferredcites →https://doi.org/10.1145/96709.96718openalex-snapshot
Interaction nets
inferredcites →https://doi.org/10.25405/ncl.34131183openalex-snapshot
Process algebraic foundations for an object-based design notation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_10openalex-snapshot
A Calculus for Interaction Nets
inferred← citeshttps://doi.org/10.1007/11539452_6openalex-snapshot
Multiport Interaction Nets and Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_30openalex-snapshot
A General Framework for Types in Graph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_2openalex-snapshot
Bigraphical Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_6openalex-snapshot
Solo Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_7openalex-snapshot
Observational Equivalence for Synchronized Graph Rewriting with Mobility
inferred← citeshttps://doi.org/10.1007/978-3-031-77731-8_19openalex-snapshot
Towards a Communication Specification Language for Heterogeneous Service Orchestration Based on Process Calculus and Holonic Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_4openalex-snapshot
Term Graph Rewriting for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_15openalex-snapshot
A Hierarchy of Expressiveness in Concurrent Interaction Nets
inferred← citeshttps://doi.org/10.1007/bfb0026563openalex-snapshot
Notes on P-algebra 1: Process structure
inferred← citeshttps://doi.org/10.1007/bfb0055620openalex-snapshot
Minimality and separation results on asynchronous mobile processes
inferred← citeshttps://doi.org/10.1007/s00236-005-0180-4openalex-snapshot
A general framework for types in graph rewriting
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00310-8openalex-snapshot
Minimality and separation results on asynchronous mobile processes – representability theorems by concurrent combinators
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80957-5openalex-snapshot
A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi…
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80248-8openalex-snapshot
Faithful π-nets.
inferred← citeshttps://doi.org/10.1017/s0960129501003486openalex-snapshot
Hypergraph construction and its application to the static analysis of concurrent systems
inferred← citeshttps://doi.org/10.1017/s096012950700610xopenalex-snapshot
Graph rewriting for the π-calculus
inferred← citeshttps://doi.org/10.1017/s0960129598002679openalex-snapshot
Type assignment and termination of interaction nets
inferred← citeshttps://doi.org/10.1017/s0960129599002947openalex-snapshot
Elementary structures in process theory (1): Sets with renaming
inferred← citeshttps://doi.org/10.1145/237721.237802openalex-snapshot
Composing processes
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.