On the public citation graph
A General Theory of Barbs, Contexts, and Labels
0 signed · 37 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/11539452_24openalex-snapshot
Deriving Weak Bisimulation Congruences from Reduction Systems
inferredcites →https://doi.org/10.1007/11548133_2openalex-snapshot
Labels from Reductions: Towards a General Theory
inferredcites →https://doi.org/10.1007/3-540-44618-4_19openalex-snapshot
Deriving Bisimulation Congruences for Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_28openalex-snapshot
Symbolic Semantics Revisited
inferredcites →https://doi.org/10.1007/978-3-540-85361-9_36openalex-snapshot
Deriving Structural Labelled Transitions for Mobile Ambients
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_20openalex-snapshot
Reactive Systems, Barbed Semantics, and the Mobile Ambients
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_10openalex-snapshot
Deriving Labels and Bisimilarity for Concurrent Constraint Programming
inferredcites →https://doi.org/10.1007/978-3-642-25318-8_22openalex-snapshot
Towards a General Theory of Barbs, Contexts and Labels
inferredcites →https://doi.org/10.1007/978-3-642-28729-9_24openalex-snapshot
Deriving Bisimulation Congruences for Conditional Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-642-37635-1_10openalex-snapshot
Barbed Semantics for Open Reactive Systems
inferredcites →https://doi.org/10.1007/bfb0055107openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/j.entcs.2009.06.014openalex-snapshot
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
inferredcites →https://doi.org/10.1016/j.ic.2005.07.003openalex-snapshot
Pure bigraphs: Structure and dynamics
inferredcites →https://doi.org/10.1016/j.ic.2008.10.005openalex-snapshot
Synthesising CCS bisimulation using graph rewriting
inferredcites →https://doi.org/10.1016/j.tcs.2009.06.010openalex-snapshot
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
inferredcites →https://doi.org/10.1016/s0304-3975(00)00309-1openalex-snapshot
From rewrite rules to bisimulation congruences
inferredcites →https://doi.org/10.1016/s0304-3975(97)00223-5openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1017/s096012950600569xopenalex-snapshot
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/1101821.1101825openalex-snapshot
Behavioral theory for mobile ambients
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_15openalex-snapshot
Implementation Correctness for Replicated Data Types, Categorically
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_14openalex-snapshot
Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_8openalex-snapshot
Asynchronous Traces and Open Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_3openalex-snapshot
Total Search Problems in Bounded Arithmetic and Improved Witnessing
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_9openalex-snapshot
Quantum Bisimilarity Is a Congruence Under Physically Admissible Schedulers
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.06.001openalex-snapshot
Observational and behavioural equivalences for soft concurrent constraint programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.005openalex-snapshot
Quasipolynomial size proofs of the propositional pigeonhole principle
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.020openalex-snapshot
Categorical specification and implementation of Replicated Data Types
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113842openalex-snapshot
When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus
inferred← citeshttps://doi.org/10.1017/s0960129524000276openalex-snapshot
Optimal approximate minimization of one-letter weighted finite automata
inferred← citeshttps://doi.org/10.1145/2971339openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/3632885openalex-snapshot
Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers
inferred← citeshttps://doi.org/10.1145/3830909openalex-snapshot
Verification of Quantum Protocols Adopting Physically Admissible Schedulers
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.