On the public citation graph
On the completeness of the equations for the Kleene star in bisimulation
0 signed · 38 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.1996.0030openalex-snapshot
Ntyft/ntyxt Rules Reduce to Ntree Rules
inferredcites →https://doi.org/10.1007/3-540-57182-5_39openalex-snapshot
A complete axiomatization for branching bisimulation congruence of finite-state behaviours
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.1016/0020-0190(94)00163-4openalex-snapshot
A complete equational axiomatization for prefix iteration
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0890-5401(89)90070-9openalex-snapshot
A complete axiomatisation for observational congruence of finite-state behaviours
inferredcites →https://doi.org/10.1017/s0960129500000116openalex-snapshot
Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
inferredcites →https://doi.org/10.1051/ita/1990240403391openalex-snapshot
Graphes canoniques de graphes algébriques
inferredcites →https://doi.org/10.1093/comjnl/37.4.243openalex-snapshot
Process Algebra with Iteration and Nesting
inferredcites →https://doi.org/10.1093/comjnl/37.4.259openalex-snapshot
Basic Process Algebra with Iteration: Completeness of its Equational Axioms
inferredcites →https://doi.org/10.1109/lics.1994.316086openalex-snapshot
Bisimulation is not finitely (first order) equationally axiomatisable
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.3233/fi-1995-24124openalex-snapshot
TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING
inferredcites →https://doi.org/10.7146/brics.v2i56.19957openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
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.1996.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
inferred← citeshttps://doi.org/10.1006/inco.1997.2645openalex-snapshot
An Equational Axiomatization for Multi-exit Iteration
inferred← citeshttps://doi.org/10.1006/inco.2002.3161openalex-snapshot
Ordered SOS Process Languages for Branching and Eager Bisimulations
inferred← citeshttps://doi.org/10.1007/11780274_20openalex-snapshot
A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_212openalex-snapshot
Axiomatizations for the perpetual loop in process algebra
inferred← citeshttps://doi.org/10.1007/bfb0014316openalex-snapshot
An equational axiomatization of observation congruence for prefix iteration
inferred← citeshttps://doi.org/10.1007/s10458-014-9263-3openalex-snapshot
A logic of intention and action for regular BDI agents based on bisimulation of agent programs
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50023-0openalex-snapshot
Process Algebra with Recursive Operations
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.053openalex-snapshot
Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
inferred← citeshttps://doi.org/10.1016/j.ic.2009.05.005openalex-snapshot
Is observational congruence on μ -expressions axiomatisable in equational Horn logic?
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00254-xopenalex-snapshot
Termination modulo equations by abstract commutation with an application to iteration
inferred← citeshttps://doi.org/10.1017/s0960129597002491openalex-snapshot
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
inferred← citeshttps://doi.org/10.1051/ita:1999127openalex-snapshot
A Finite Axiomatization of Nondeterministic Regular Expressions
inferred← citeshttps://doi.org/10.1093/logcom/12.2.301openalex-snapshot
An Equational Axiomatization of Bisimulation over Regular Expressions
inferred← citeshttps://doi.org/10.1142/9789812562494_0053openalex-snapshot
SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA
inferred← citeshttps://doi.org/10.1201/b21197-3openalex-snapshot
Computing Categories, Language Fragments, and Models
inferred← citeshttps://doi.org/10.3233/fi-2021-2026openalex-snapshot
Using Hoare Logic in a Process Algebra Setting
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12740openalex-snapshot
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
inferred← citeshttps://doi.org/10.7146/brics.v3i22.19985openalex-snapshot
An Equational Axiomatization for Multi-Exit Iteration
inferred← citeshttps://doi.org/10.7146/brics.v3i23.20003openalex-snapshot
A Menagerie of Non-Finitely Based Process Semantics over BPA*: From Ready Simulation Semantics to Completed Traces
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.