On the public citation graph
The problem of “weak bisimulation up to”
0 signed · 162 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.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-54415-1_45openalex-snapshot
An efficiency preorder for processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9942(199901/03)5:1<25::aid-tapo3>3.0.co;2-aopenalex-snapshot
Typed ?-calculus at work: A correctness proof of Jones's parallelisation transformation on concurrent objects
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1006/inco.2002.3086openalex-snapshot
Secure Implementation of Channel Abstractions
inferred← citeshttps://doi.org/10.1006/inco.2002.3172openalex-snapshot
Mobile Objects as Mobile Processes
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_42openalex-snapshot
Behavioural Theory for Mobile Ambients
inferred← citeshttps://doi.org/10.1007/11494881_4openalex-snapshot
XPi: A Typed Process Calculus for XML Messaging
inferred← citeshttps://doi.org/10.1007/11523468_59openalex-snapshot
Up-to Techniques for Weak Bisimulation
inferred← citeshttps://doi.org/10.1007/11539452_23openalex-snapshot
Bisimulations Up-to for the Linear Time Branching Time Spectrum
inferred← citeshttps://doi.org/10.1007/11562436_25openalex-snapshot
Proof Methodologies for Behavioural Equivalence in Dpi
inferred← citeshttps://doi.org/10.1007/11693024_11openalex-snapshot
Bisimulations for Untyped Imperative Objects
inferred← citeshttps://doi.org/10.1007/11768869_3openalex-snapshot
The Bisimulation Proof Method: Enhancements and Open Problems
inferred← citeshttps://doi.org/10.1007/11804192_8openalex-snapshot
Beyond Bisimulation: The “up-to” Techniques
inferred← citeshttps://doi.org/10.1007/11817949_26openalex-snapshot
Weak Bisimulation Up to Elaboration
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_8openalex-snapshot
Communication Interference in Mobile Boxed Ambients
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_18openalex-snapshot
A Faster-than Relation for Asynchronous Processes
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-45699-6_6openalex-snapshot
The Join Calculus: A Language for Distributed Mobile Programming
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-46691-6_10openalex-snapshot
A Top-Down Look at a Secure Message
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_36openalex-snapshot
Proof-Checking Protocols Using Bisimulations
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_18openalex-snapshot
Unique Fixed Point Induction for McCarthy’s Amb
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_21openalex-snapshot
A π-calculus Process Semantics of Concurrent Idealised ALGOL
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_4openalex-snapshot
A practical technique for process abstraction
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_107openalex-snapshot
Locality and true-concurrency in calculi for mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_77openalex-snapshot
A fully abstract semantics for causality in the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_54openalex-snapshot
On the expressiveness of internal mobility in name-passing calculi
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-1-4471-3078-9_4openalex-snapshot
Conformance: A Precongruence close to Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_6openalex-snapshot
Playing with Bisimulation in Erlang
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_24openalex-snapshot
Up-to Techniques for Branching Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_5openalex-snapshot
Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_3openalex-snapshot
Noninterference Analysis of Reversible Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-66438-0_3openalex-snapshot
Preorder-Constrained Simulations for Program Refinement with Effects
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_5openalex-snapshot
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-85134-6_19openalex-snapshot
Proof Techniques for Behavioural Relations Based on Unique-Solutions of Equations and Inequations
inferred← citeshttps://doi.org/10.1007/978-3-031-95497-9_5openalex-snapshot
Noninterference Analysis of Stochastically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_16openalex-snapshot
Noninterference Analysis of Deterministically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_13openalex-snapshot
Extracting Proofs from Tabled Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_13openalex-snapshot
Parameterised Bisimulations: Some Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_5openalex-snapshot
The Proof Technique of Unique Solutions of Contractions
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_7openalex-snapshot
Boxed Ambients with Communication Interfaces
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-40965-6_14openalex-snapshot
A Calculus of Bounded Capacities
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_10openalex-snapshot
On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_24openalex-snapshot
Complete Lattices and Up-To Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_18openalex-snapshot
A Theory of Non-monotone Memory (Or: Contexts for free)
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_17openalex-snapshot
The Calculus of Handshake Configurations
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_19openalex-snapshot
Normal Bisimulations in Calculi with Passivation
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_33openalex-snapshot
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_22openalex-snapshot
The Higher-Order, Call-by-Value Applied Pi-Calculus
inferred← citeshttps://doi.org/10.1007/bfb0055107openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferred← citeshttps://doi.org/10.1007/bfb0055108openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1007/bfb0055619openalex-snapshot
From higher-order π-calculus to π-calculus in the presence of static operators
inferred← citeshttps://doi.org/10.1007/s00165-019-00497-wopenalex-snapshot
Bisimulation and Coinduction Enhancements: A Historical Perspective
inferred← citeshttps://doi.org/10.1007/s00236-009-0112-9openalex-snapshot
On the observational theory of the CPS-calculus
inferred← citeshttps://doi.org/10.1007/s00236-012-0168-9openalex-snapshot
Distinguishing and relating higher-order and first-order processes by expressiveness
inferred← citeshttps://doi.org/10.1007/s002360050124openalex-snapshot
A fully abstract semantics for causality in the $\pi$ -calculus
inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot
Process algebra with action dependencies
inferred← citeshttps://doi.org/10.1007/s10817-018-9475-3openalex-snapshot
A Proof Theory for Model Checking
inferred← citeshttps://doi.org/10.1007/s11390-009-9210-yopenalex-snapshot
Expressing First-Order π-Calculus in Higher-Order Calculus of Communicating Systems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00020-8openalex-snapshot
Locality and interleaving semantics in calculi for mobile processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.016openalex-snapshot
A Study On The Potential Active Names of π-Agents
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.010openalex-snapshot
From Active Names to π-calculus Rewriting Rules
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.016openalex-snapshot
On the Observational Theory of the CPS-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.054openalex-snapshot
Synchrony vs Asynchrony in Communication Primitives
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.039openalex-snapshot
An Observational Theory for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1016/j.ic.2002.08.001openalex-snapshot
Bisimulation on speed: worst-case efficiency
inferred← citeshttps://doi.org/10.1016/j.ic.2005.06.002openalex-snapshot
Communication and mobility control in boxed ambients
inferred← citeshttps://doi.org/10.1016/j.ic.2007.05.001openalex-snapshot
Priority and abstraction in process algebra
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.003openalex-snapshot
(Bi)simulations up-to characterise process semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2011.08.002openalex-snapshot
Characterizing contextual equivalence in calculi with passivation
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104603openalex-snapshot
Team equivalences for finite-state machines with silent moves
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104606openalex-snapshot
Unique solutions of contractions, CCS, and their HOL formalisation
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.05.002openalex-snapshot
Safe Ambients: Abstract machine and distributed implementation
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.2008.02.001openalex-snapshot
XPi: A typed process calculus for XML messaging
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.10.005openalex-snapshot
On the representation of McCarthy's amb in the π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.11.017openalex-snapshot
Space-aware ambients and processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.032openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.060openalex-snapshot
New up-to techniques for weak bisimulation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.035openalex-snapshot
Using bisimulation proof techniques for the analysis of distributed abstract machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.009openalex-snapshot
A bisimulation-like proof method for contextual properties in untyped λ -calculus with references and deallocation
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00109-xopenalex-snapshot
Communication errors in the -calculus are undecidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00097-9openalex-snapshot
Asynchronous process calculi: the first- and higher-order paradigms
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(97)00220-xopenalex-snapshot
On the expressiveness of internal mobility in name-passing calculi
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93172-xopenalex-snapshot
Mobile Objects as Mobile Processes
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)80683-2openalex-snapshot
Coordination Model and Noninterference
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)80477-3openalex-snapshot
Bisimilarity of open terms
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.007openalex-snapshot
Enhancements of the bisimulation proof method
inferred← citeshttps://doi.org/10.1017/s0956796825000036openalex-snapshot
Recursive subtyping for all
inferred← citeshttps://doi.org/10.1017/s0960129504004323openalex-snapshot
On asynchrony in name-passing calculi
inferred← citeshttps://doi.org/10.1017/s096012950600569xopenalex-snapshot
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
inferred← citeshttps://doi.org/10.1017/s0960129507006226openalex-snapshot
Boxed ambients with communication interfaces
inferred← citeshttps://doi.org/10.1017/s0960129508006658openalex-snapshot
Types for ambient and process mobility
inferred← citeshttps://doi.org/10.1017/s0960129508007111openalex-snapshot
A ground-complete axiomatisation of finite-state processes in a generic process algebra
inferred← citeshttps://doi.org/10.1017/s0960129525000015openalex-snapshot
On higher-order communication in ambient calculi
inferred← citeshttps://doi.org/10.1017/s0960129598002527openalex-snapshot
On the bisimulation proof method
inferred← citeshttps://doi.org/10.1080/00207160.2016.1210793openalex-snapshot
On parameterization of higher-order processes
inferred← citeshttps://doi.org/10.1109/acsd.2005.11openalex-snapshot
Dead-Path-Elimination in BPEL4WS
inferred← citeshttps://doi.org/10.1109/lics.1998.705647openalex-snapshot
Secure implementation of channel abstractions
inferred← citeshttps://doi.org/10.1109/lics.1999.782586openalex-snapshot
Towards a theory of bisimulation for local names
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.1109/lics.2001.932508openalex-snapshot
A symbolic labelled transition system for coinductive subtyping of F/sub μ≤/ types
inferred← citeshttps://doi.org/10.1109/lics.2007.17openalex-snapshot
Environmental Bisimulations for Higher-Order Languages
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/1040305.1040311openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1101821.1101825openalex-snapshot
Behavioral theory for mobile ambients
inferred← citeshttps://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1111320.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1119479.1119482openalex-snapshot
A bisimulation-based semantic theory of Safe Ambients
inferred← citeshttps://doi.org/10.1145/1190215.1190253openalex-snapshot
Secure implementations of typed channel abstractions
inferred← citeshttps://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferred← citeshttps://doi.org/10.1145/2364527.2364546openalex-snapshot
Operational semantics using the partiality monad
inferred← citeshttps://doi.org/10.1145/237721.237805openalex-snapshot
The reflexive CHAM and the join-calculus
inferred← citeshttps://doi.org/10.1145/2676724.2693170openalex-snapshot
A Lightweight Formalization of the Metatheory of Bisimulation-Up-To
inferred← citeshttps://doi.org/10.1145/2676726.2676965openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/2854065.2854080openalex-snapshot
Bisimulation up-to techniques for psi-calculi
inferred← citeshttps://doi.org/10.1145/2971339openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/298595.298860openalex-snapshot
Verification of an audio control protocol within real time process algebra
inferred← citeshttps://doi.org/10.1145/3498679openalex-snapshot
From enhanced coinduction towards enhanced induction
inferred← citeshttps://doi.org/10.1145/503272.503280openalex-snapshot
Bisimulation congruences in safe ambients
inferred← citeshttps://doi.org/10.1145/565816.503280openalex-snapshot
Bisimulation congruences in safe ambients
inferred← citeshttps://doi.org/10.1145/964001.964015openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.17760/d10016545openalex-snapshot
Reasoning about imperative and higher-order programs
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-4(1:7)2008openalex-snapshot
Algebraic Pattern Matching in Join Calculus
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:1)2021openalex-snapshot
Axiomatizing Maximal Progress and Discrete Time
inferred← citeshttps://doi.org/10.2514/6.2008-3545openalex-snapshot
Issues and Problems in test & Operations Language Translation
inferred← citeshttps://doi.org/10.3233/jcs-2004-12202openalex-snapshot
A process-algebraic approach for the analysis of probabilistic noninterference
inferred← citeshttps://doi.org/10.4204/eptcs.276.10openalex-snapshot
Unique Solutions of Contractions, CCS, and their HOL Formalisation
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.25openalex-snapshot
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.88openalex-snapshot
Abstract Congruence Criteria for Weak Bisimilarity
inferred← citeshttps://doi.org/10.48456/tr-514openalex-snapshot
Nomadic π-calculi: expressing and verifying communication infrastructure for mobile computation
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2107openalex-snapshot
Knots as processes: a new kind of invariant
inferred← citeshttps://doi.org/10.48550/arxiv.1712.09402openalex-snapshot
A Formalization of Unique Solutions of Equations in Process Algebra
inferred← citeshttps://doi.org/10.70675/af3542bezb228z4b06za5cfz0ff8a71f328dopenalex-snapshot
Typed Behavioural Equivalences in the Pi-Calculus
inferred← citeshttps://doi.org/10.70675/e3e2df45z9110z4f8dza99bzbf2dc0e2a9bdopenalex-snapshot
Unique solution techniques for processes and functions
inferred← citeshttps://doi.org/10.7146/brics.v4i24.18950openalex-snapshot
Relational Reasoning about Contexts
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.