On the public citation graph
A hierarchy of equivalences for asynchronous calculi
0 signed · 90 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.1006/inco.1995.1114openalex-snapshot
Testing Equivalence for Mobile Processes
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-55613-3_2openalex-snapshot
On asynchronous communication semantics
inferredcites →https://doi.org/10.1007/3-540-57785-8_171openalex-snapshot
The complete axiomatization of Cs-congruence
inferredcites →https://doi.org/10.1007/3-540-60084-1_112openalex-snapshot
Divergence and fair testing
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-63141-0_14openalex-snapshot
Implicit typing à la ML for the join-calculus
inferredcites →https://doi.org/10.1007/3-540-63141-0_5openalex-snapshot
Reasoning about cryptographic protocols in the spi calculus
inferredcites →https://doi.org/10.1007/978-0-387-35079-0_9openalex-snapshot
Applications of Fair Testing
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-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0084781openalex-snapshot
The problem of “weak bisimulation up to”
inferredcites →https://doi.org/10.1007/bfb0084813openalex-snapshot
Multiway synchronization verified with coupled simulation
inferredcites →https://doi.org/10.1007/s002360050036openalex-snapshot
A theory of bisimulation for the π-calculus
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(95)00074-7openalex-snapshot
On reduction-based process semantics
inferredcites →https://doi.org/10.1016/s0022-3093(97)00315-3openalex-snapshot
The interaction of Mn2+ with porous silica xerogels and the hydration-dehydration processes in the xerogels
inferredcites →https://doi.org/10.1016/s0304-3975(97)00223-5openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1016/s1571-0661(05)82514-9openalex-snapshot
Secure Implementation of Channel Abstractions (Abstract)
inferredcites →https://doi.org/10.1017/s095679689700261xopenalex-snapshot
A foundation for actor computation
inferredcites →https://doi.org/10.1017/s0960129598002527openalex-snapshot
On the bisimulation proof method
inferredcites →https://doi.org/10.1145/237721.237805openalex-snapshot
The reflexive CHAM and the join-calculus
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.2001.3080openalex-snapshot
Trace and Testing Equivalence on Asynchronous Processes
inferred← citeshttps://doi.org/10.1006/inco.2002.3086openalex-snapshot
Secure Implementation of Channel Abstractions
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_42openalex-snapshot
Behavioural Theory for Mobile Ambients
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_20openalex-snapshot
On Barbed Equivalences in π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_47openalex-snapshot
Bisimulation Proof Methods for Mobile Ambients
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_7openalex-snapshot
High-Level Petri Nets as Type Theories in the Join Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_20openalex-snapshot
Weakest Congruence Results Concerning “Any-Lock”
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_19openalex-snapshot
A Calculus of Mobile Resources*
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/978-0-387-09680-3_34openalex-snapshot
Deconstructing behavioural theories of mobility
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-35608-2_45openalex-snapshot
On Reduction Semantics for the Push and Pull Ambient Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_34openalex-snapshot
Strong Bisimulation for the Explicit Fusion Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_8openalex-snapshot
Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_17openalex-snapshot
Full Abstraction for Polymorphic Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_18openalex-snapshot
Foundations of Web Transactions
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-40965-6_13openalex-snapshot
A Calculus for Secure Mobility
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_20openalex-snapshot
Reactive Systems, Barbed Semantics, and the Mobile Ambients
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_46openalex-snapshot
On Observing Dynamic Prioritised Actions in SOC
inferred← citeshttps://doi.org/10.1007/bf02944905openalex-snapshot
Towards a theory of bisimulation for the higher-order process calculi
inferred← citeshttps://doi.org/10.1007/bfb0055108openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.005openalex-snapshot
Contextual Labelled Semantics for Higher-order 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.jlap.2006.08.001openalex-snapshot
The SL synchronous language, revisited
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.03.005openalex-snapshot
A theory of bisimulation for a fragment of concurrent ML with local names
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.2007.09.020openalex-snapshot
Full abstraction for polymorphic π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.014openalex-snapshot
More on bisimulations for higher order π -calculus
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/s1571-0661(03)50008-1openalex-snapshot
Contextual Equivalence for Higher-Order π-Calculus Revisited
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)00309-3openalex-snapshot
Typed behavioural equivalences for processes in the presence of subtyping
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80415-8openalex-snapshot
Barbs and Congruences for Safe Mobile Ambients
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80419-5openalex-snapshot
Abstractions for Fault-Tolerant Global Computing
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)82502-2openalex-snapshot
The Two-Phase Commitment Protocol in an Extended π-Calculus
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.007openalex-snapshot
Enhancements of the bisimulation proof method
inferred← citeshttps://doi.org/10.1017/s0960129504004281openalex-snapshot
Typed behavioural equivalences for processes in the presence of subtyping
inferred← citeshttps://doi.org/10.1017/s0960129504004323openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1109/lics.1998.705647openalex-snapshot
Secure implementation of channel abstractions
inferred← citeshttps://doi.org/10.1109/lics.2000.855780openalex-snapshot
A theory of bisimulation for a fragment of Concurrent ML with local names
inferred← citeshttps://doi.org/10.1145/1101821.1101825openalex-snapshot
Behavioral theory for mobile ambients
inferred← citeshttps://doi.org/10.1145/2631916openalex-snapshot
A General Theory of Barbs, Contexts, and Labels
inferred← citeshttps://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
inferred← citeshttps://doi.org/10.1145/373243.360213openalex-snapshot
Mobile values, new names, and secure communication
inferred← citeshttps://doi.org/10.2168/lmcs-1(1:4)2005openalex-snapshot
Contextual equivalence for higher-order pi-calculus revisited
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:15)2009openalex-snapshot
Explicit fairness in testing semantics
inferred← citeshttps://doi.org/10.3233/jcs-2004-123-407openalex-snapshot
Type-based cryptographic operations*
inferred← citeshttps://doi.org/10.48456/tr-496openalex-snapshot
Contexts and embeddings for closed shallow action graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1609.03003openalex-snapshot
The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication
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.