On the public citation graph

An equational axiomatization of observation congruence for prefix iteration

0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1996.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
inferredcites →https://doi.org/10.1007/3-540-58338-6_100openalex-snapshot
A completeness theorem for nondeterministic Kleene algebras
inferredcites →https://doi.org/10.1007/3-540-60218-6_10openalex-snapshot
Fully abstract models for nondeterministic regular expressions
inferredcites →https://doi.org/10.1007/bfb0014315openalex-snapshot
On the completeness of the equations for the Kleene star in bisimulation
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0039068openalex-snapshot
A new strategy for proving ω-completeness applied to process algebra
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/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/s0019-9958(81)90082-6openalex-snapshot
A term model for synchronous processes
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0065-2458(08)60462-3openalex-snapshot
Information and Computation
inferredcites →https://doi.org/10.1080/00029890.1995.12004627openalex-snapshot
How to Write a Proof
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.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.7146/brics.v2i5.19507openalex-snapshot
A Complete Equational Axiomatization for Prefix Iteration with Silent Steps
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.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.1006/jcss.1999.1636openalex-snapshot
Models of Nondeterministic Regular Expressions
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_16openalex-snapshot
Axiomatizing flat iteration
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50023-0openalex-snapshot
Process Algebra with Recursive Operations
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00413-8openalex-snapshot
Non-regular iterators in process algebra
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00182-5openalex-snapshot
A complete equational axiomatization for MPA with string iteration
inferred← citeshttps://doi.org/10.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
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.1145/504794.504799openalex-snapshot
Register-machine based processes
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.