On the public citation graph
On asynchrony in name-passing calculi
0 signed · 135 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/(sici)1096-9942(199901/03)5:1<25::aid-tapo3>3.3.co;2-1openalex-snapshot
Typed π‐calculus at work: A correctness proof of Jones's parallelisation transformation on concurrent objects
inferredcites →https://doi.org/10.1006/inco.1994.1042openalex-snapshot
The Lazy Lambda Calculus in a Concurrency Scenario
inferredcites →https://doi.org/10.1006/inco.1996.0096openalex-snapshot
Bisimulation for Higher-Order Process Calculi
inferredcites →https://doi.org/10.1006/inco.1998.2711openalex-snapshot
An Interpretation of Typed Objects into Typedπ-Calculus
inferredcites →https://doi.org/10.1007/3-540-45699-6_6openalex-snapshot
The Join Calculus: A Language for Distributed Mobile Programming
inferredcites →https://doi.org/10.1007/3-540-54415-1_63openalex-snapshot
π-Calculus semantics of object-oriented programming 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-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-63165-8_189openalex-snapshot
A proof theoretical approach to communication
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/978-0-387-35358-6_20openalex-snapshot
Imperative Objects and Mobile Processes
inferredcites →https://doi.org/10.1007/978-0-387-35358-6_9openalex-snapshot
Bisimulations in the Join-Calculus
inferredcites →https://doi.org/10.1007/978-3-540-49382-2_9openalex-snapshot
Testing Theories for Asynchronous Languages
inferredcites →https://doi.org/10.1007/bf01191894openalex-snapshot
An efficiency preorder for processes
inferredcites →https://doi.org/10.1007/bfb0030607openalex-snapshot
A labelled transition system for πε-calculus
inferredcites →https://doi.org/10.1007/bfb0055107openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferredcites →https://doi.org/10.1007/bfb0055620openalex-snapshot
Minimality and separation results on asynchronous mobile processes
inferredcites →https://doi.org/10.1007/bfb0057019openalex-snapshot
An object calculus for asynchronous communication
inferredcites →https://doi.org/10.1007/bfb0084781openalex-snapshot
The problem of “weak bisimulation up to”
inferredcites →https://doi.org/10.1016/0304-3975(94)00104-9openalex-snapshot
On the π-calculus and linear logic
inferredcites →https://doi.org/10.1016/0304-3975(95)00020-8openalex-snapshot
Locality and interleaving semantics in calculi for mobile processes
inferredcites →https://doi.org/10.1016/0304-3975(95)00074-7openalex-snapshot
On reduction-based process semantics
inferredcites →https://doi.org/10.1016/0304-3975(96)00075-8openalex-snapshot
π-Calculus, internal mobility, and agent-passing calculi
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/s0304-3975(97)00149-7openalex-snapshot
A process algebraic view of Linda coordination primitives
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.1016/s0304-3975(97)00222-3openalex-snapshot
On transformations of concurrent-object programs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00223-5openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(99)00040-7openalex-snapshot
The name discipline of uniform receptiveness
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s096012950007002xopenalex-snapshot
Typing and subtyping for mobile processes
inferredcites →https://doi.org/10.1063/1.3050748openalex-snapshot
Association for Computing Machinery
inferredcites →https://doi.org/10.1109/lics.1998.705653openalex-snapshot
Bisimulation in name-passing calculi without matching
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/199448.199516openalex-snapshot
A language with distributed scope
inferredcites →https://doi.org/10.11501/3103802openalex-snapshot
A process-calculus approach to typed concurrent objects
inferredcites →https://doi.org/10.7146/brics.v3i38.20020openalex-snapshot
Objects as Mobile Processes
inferredcites →https://doi.org/10.7146/brics.v3i8.19971openalex-snapshot
Bisimulations for Asynchronous Mobile Processes
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0022openalex-snapshot
Pict: A Programming Language Based on the Pi-Calculus
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0033openalex-snapshot
Lazy Functions and Mobile Processes
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.2002.3172openalex-snapshot
Mobile Objects as Mobile Processes
inferred← citeshttps://doi.org/10.1007/11817949_21openalex-snapshot
Encoding ℂDuce in the ℂπ-Calculus
inferred← citeshttps://doi.org/10.1007/11924661_16openalex-snapshot
Computational Secrecy by Typing for the Pi Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_1openalex-snapshot
Region Analysis and a π-Calculus with Groups
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_34openalex-snapshot
Typing Non-uniform Concurrent Objects
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_28openalex-snapshot
Local π-Calculus at Work: Mobile Objects as Mobile Processes
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_29openalex-snapshot
An Interpretation of Typed Concurrent Objects in the Blue Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45314-8_9openalex-snapshot
Strengthening UML Collaboration Diagrams by State Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_2openalex-snapshot
Secrecy Types for Asymmetric Communication
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_6openalex-snapshot
The Join Calculus: A Language for Distributed Mobile Programming
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_16openalex-snapshot
A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching
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-46432-8_19openalex-snapshot
On Synchronous and Asynchronous Mobile Processes
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_191openalex-snapshot
Aliasing Models for Object Migration⋆
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/3-540-49019-1_3openalex-snapshot
Reasoning about Concurrent Systems Using Types
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_9openalex-snapshot
Bisimulations in the Join-Calculus
inferred← citeshttps://doi.org/10.1007/978-0-387-35496-5_11openalex-snapshot
A Theory of May Testing for Actors
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_9openalex-snapshot
A Model of Actors and Grey Failures
inferred← citeshttps://doi.org/10.1007/978-3-540-24631-2_3openalex-snapshot
A Survey of Name-Passing Calculi and Crypto-Primitives
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_39openalex-snapshot
Techniques for Executing and Reasoning about Specification Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_27openalex-snapshot
Compiling Pattern Matching in Join-Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_10openalex-snapshot
A Concurrent System of Multi-ported Processes with Causal Dependency
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_14openalex-snapshot
A Calculus for Modeling Software Components
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_4openalex-snapshot
An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_9openalex-snapshot
Testing Theories for Asynchronous Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_38openalex-snapshot
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_12openalex-snapshot
Axiomatization Without Prefix Combinator
inferred← citeshttps://doi.org/10.1007/bf02713937openalex-snapshot
A functional presentation of Pi calculus
inferred← citeshttps://doi.org/10.1007/bfb0055620openalex-snapshot
Minimality and separation results on asynchronous mobile processes
inferred← citeshttps://doi.org/10.1007/s100090100041openalex-snapshot
Bisimulation verification using the up to techniques
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.033openalex-snapshot
Mobile Agents in Interaction Spaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.009openalex-snapshot
Separation of Synchronous and Asynchronous Communication Via Testing
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.006openalex-snapshot
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.092openalex-snapshot
A Calculus for Generation, Verification and Refinement of BPEL Specifications
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.004openalex-snapshot
Strong normalisation in the π-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.004openalex-snapshot
Types and full abstraction for polyadic π-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2010.05.002openalex-snapshot
Towards a unified approach to encodability and separation results for process calculi
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.01.006openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferred← citeshttps://doi.org/10.1016/j.scico.2005.07.010openalex-snapshot
Classification of security properties in a Linda-like process algebra
inferred← citeshttps://doi.org/10.1016/j.scico.2007.01.011openalex-snapshot
Coordinating mobile agents in interaction spaces
inferred← citeshttps://doi.org/10.1016/j.scico.2009.03.002openalex-snapshot
PiDuce — A project for experimenting Web services technologies
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.022openalex-snapshot
A calculus for reasoning about software composition
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.005openalex-snapshot
On the representation of McCarthy's amb in the π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.009openalex-snapshot
Separation of synchronous and asynchronous communication via testing
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00283-8openalex-snapshot
Bisimulations in the join-calculus
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/s0304-3975(02)00373-0openalex-snapshot
Understanding the mismatch combinator in chi calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00863-0openalex-snapshot
Secrecy types for asymmetric communication
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00202-0openalex-snapshot
Tau laws for pi calculus
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93172-xopenalex-snapshot
Mobile Objects as Mobile Processes
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00061-0openalex-snapshot
Bisimulation congruence of chi calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00122-7openalex-snapshot
On the Expressiveness of Chi, Update, and Fusion calculi
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00123-9openalex-snapshot
On the Expressive Power of Joint Input
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80683-2openalex-snapshot
Coordination Model and Noninterference
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.1016/s1571-0661(05)80361-5openalex-snapshot
On the Expressive Power of Polyadic Synchronisation in π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82506-xopenalex-snapshot
On the Expressiveness of Pure Mobile Ambients
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82539-3openalex-snapshot
An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0
inferred← citeshttps://doi.org/10.1017/s0956796801004270openalex-snapshot
Region analysis and a π-calculus with groups
inferred← citeshttps://doi.org/10.1017/s0960129503004079openalex-snapshot
On the expressiveness of pure safe ambients
inferred← citeshttps://doi.org/10.1017/s0960129509990247openalex-snapshot
Channel abstractions for network security
inferred← citeshttps://doi.org/10.1023/a:1010064516533openalex-snapshot
The π-Calculus in Direct Style
inferred← citeshttps://doi.org/10.1109/acsd.2005.6openalex-snapshot
BoPi — A Distributed Machine for Experimenting Web Services Technologies
inferred← citeshttps://doi.org/10.1109/csf.2008.17openalex-snapshot
Language Based Secure Communication
inferred← citeshttps://doi.org/10.1109/csfw.2004.1310731openalex-snapshot
A distributed calculus for role-based access control
inferred← citeshttps://doi.org/10.1109/csfw.2006.32openalex-snapshot
Verified Interoperable Implementations of Security Protocols
inferred← citeshttps://doi.org/10.1109/tase.2018.00011openalex-snapshot
A Fully Abstract Encoding for Sub Asynchronous Pi Calculus
inferred← citeshttps://doi.org/10.1145/1452044.1452049openalex-snapshot
Verified interoperable implementations of security protocols
inferred← citeshttps://doi.org/10.1145/937563.937564openalex-snapshot
The receptive distributed π-calculus
inferred← citeshttps://doi.org/10.2168/lmcs-4(1:7)2008openalex-snapshot
Algebraic Pattern Matching in Join Calculus
inferred← citeshttps://doi.org/10.3233/fun-2002-53201openalex-snapshot
On message deliverability and non-uniform receptivity
inferred← citeshttps://doi.org/10.4204/eptcs.40openalex-snapshot
Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:13)2023openalex-snapshot
A model of actors and grey failures
inferred← citeshttps://doi.org/10.5281/zenodo.41702openalex-snapshot
Diversity Order For The Amplify-And-Forward Multiple-Relay Channel With Randomized Distributed Space-Time Coding
inferred← citeshttps://doi.org/10.7146/brics.v5i33.19439openalex-snapshot
Migration = Cloning ; Aliasing (Preliminary Version)
inferred← citeshttps://doi.org/10.7892/boris.104365openalex-snapshot
Forms, Agents and Channels: Defining Composition Abstraction with Style
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.