On the public citation graph
Bisimilarity Is Not Finitely Based over BPA with Interrupt
0 signed · 33 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-45022-x_61openalex-snapshot
An ω-Complete Equational Specification of Interleaving
inferredcites →https://doi.org/10.1007/3-540-45061-0_10openalex-snapshot
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
inferredcites →https://doi.org/10.1007/3-540-46541-3_22openalex-snapshot
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers
inferredcites →https://doi.org/10.1007/3-540-57208-2_33openalex-snapshot
A congruence theorem for structured operational semantics with predicates
inferredcites →https://doi.org/10.1007/3-540-60692-0_57openalex-snapshot
On the expressive power of CCS
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_14openalex-snapshot
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0032072openalex-snapshot
The importance of the left merge operator in process algebras
inferredcites →https://doi.org/10.1007/bfb0039068openalex-snapshot
A new strategy for proving ω-completeness applied to process algebra
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(88)90124-7openalex-snapshot
The equational theory of pomsets
inferredcites →https://doi.org/10.1016/j.ic.2004.02.001openalex-snapshot
Nested semantics over finite trees are equationally hard
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.003openalex-snapshot
CCS with Hennessy's merge has no finite-equational axiomatization
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0168-0072(97)00036-5openalex-snapshot
Nonaxiomatisability of equivalences over finite state processes
inferredcites →https://doi.org/10.1016/s0304-3975(02)00236-0openalex-snapshot
The max-plus algebra of the natural numbers has no finite equational basis
inferredcites →https://doi.org/10.1017/s0960129597002491openalex-snapshot
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
inferredcites →https://doi.org/10.1109/lics.1990.113741openalex-snapshot
The nonexistence of finite axiomatisations for CCS congruences
inferredcites →https://doi.org/10.1137/0217063openalex-snapshot
Axiomatising Finite Concurrent Processes
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferredcites →https://doi.org/10.3233/fi-1986-9202openalex-snapshot
Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra1
inferredcites →https://doi.org/10.7146/brics.v11i24.21849openalex-snapshot
Bisimilarity is not Finitely Based over BPA with Interrupt
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11787006_41openalex-snapshot
On the Axiomatizability of Priority
inferred← citeshttps://doi.org/10.7146/brics.v11i24.21849openalex-snapshot
Bisimilarity is not Finitely Based over BPA with Interrupt
inferred← citeshttps://doi.org/10.7146/brics.v11i25.21850openalex-snapshot
On the Recursive Enumerability of Fixed-Point Combinators
inferred← citeshttps://doi.org/10.7146/brics.v11i26.21851openalex-snapshot
Refocusing in Reduction Semantics
inferred← citeshttps://doi.org/10.7146/brics.v11i30.21855openalex-snapshot
From Reduction-Based to Reduction-Free Normalization
inferred← citeshttps://doi.org/10.7146/brics.v11i31.21856openalex-snapshot
Strongly Uniform Bounds from Semi-Constructive Proofs
inferred← citeshttps://doi.org/10.7146/brics.v12i33.21900openalex-snapshot
Bisimilarity is not Finitely Based over BPA with Interrupt
inferred← citeshttps://doi.org/10.7146/brics.v13i1.21907openalex-snapshot
On the Axiomatizability of Priority
inferred← citeshttps://doi.org/10.7146/brics.v14i11.21933openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.7146/brics.v14i5.21928openalex-snapshot
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
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.