On the public citation graph
Minimality and separation results on asynchronous mobile processes
0 signed · 43 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.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1007/3-540-57887-0_125openalex-snapshot
Replication in concurrent combinators
inferredcites →https://doi.org/10.1007/3-540-58043-3_18openalex-snapshot
Some Chemical Abstract Machines
inferredcites →https://doi.org/10.1007/3-540-58043-3_27openalex-snapshot
Algebraic theories for name-passing calculi
inferredcites →https://doi.org/10.1007/3-540-61604-7_53openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1007/3-540-61604-7_54openalex-snapshot
On the expressiveness of internal mobility in name-passing calculi
inferredcites →https://doi.org/10.1007/3-540-62034-6_64openalex-snapshot
Graph types for monadic mobile processes
inferredcites →https://doi.org/10.1007/3-540-63383-9_92openalex-snapshot
An asynchronous model of locality, failure, and process mobility
inferredcites →https://doi.org/10.1007/bfb0026563openalex-snapshot
Notes on P-algebra 1: Process structure
inferredcites →https://doi.org/10.1007/bfb0026581openalex-snapshot
Graph notation for concurrent combinators
inferredcites →https://doi.org/10.1007/bfb0055108openalex-snapshot
On asynchrony in name-passing calculi
inferredcites →https://doi.org/10.1007/bfb0057019openalex-snapshot
An object calculus for asynchronous communication
inferredcites →https://doi.org/10.1016/0167-739x(90)90024-8openalex-snapshot
The expressive power of parallelism
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/0304-3975(95)00074-7openalex-snapshot
On reduction-based process semantics
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0304-3975(97)00220-xopenalex-snapshot
On the expressiveness of internal mobility in name-passing calculi
inferredcites →https://doi.org/10.1109/lics.1998.705654openalex-snapshot
The fusion calculus: expressiveness and symmetry in mobile processes
inferredcites →https://doi.org/10.1145/127056.127079openalex-snapshot
A small calculus for concurrent objects
inferredcites →https://doi.org/10.1145/127070.127079openalex-snapshot
A small calculus for concurrent objects
inferredcites →https://doi.org/10.1145/174675.177953openalex-snapshot
Combinatory representation of mobile processes
inferredcites →https://doi.org/10.1145/263699.263731openalex-snapshot
Comparing the expressive power of the synchronous and the asynchronous π-calculus
inferredcites →https://doi.org/10.1145/267959.269967openalex-snapshot
Combinatory formulations of concurrent languages
inferredcites →https://doi.org/10.1145/268946.268978openalex-snapshot
A typed language for distributed mobile processes (extended abstract)
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-46432-8_16openalex-snapshot
Locality and Polyadicity in Asynchronous Name-Passing Calculi
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_38openalex-snapshot
Subtyping and Locality in Distributed Higher Order Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_14openalex-snapshot
Rigid Families for CCS and the $$\pi $$ -calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_13openalex-snapshot
Access Control Based on Code Identity for Open Distributed Systems
inferred← citeshttps://doi.org/10.1007/bfb0055108openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.011openalex-snapshot
Expressiveness of Process Algebras
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(05)80295-6openalex-snapshot
On Equators in Asynchronous Name-passing Calculi without Matching – Extended Abstract –
inferred← citeshttps://doi.org/10.1017/s0960129504004323openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1017/s0960129599002947openalex-snapshot
Elementary structures in process theory (1): Sets with renaming
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.