On the public citation graph

A new strategy for proving ω-completeness applied to process algebra

0 signed · 53 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.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferredcites →https://doi.org/10.1016/0004-3702(87)90017-8openalex-snapshot
Proof by consistency
inferredcites →https://doi.org/10.1016/0167-6423(85)90010-3openalex-snapshot
Top-down design and the algebra of communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(86)90173-8openalex-snapshot
Partial evaluation and ω-completeness of algebraic specifications
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.1016/0890-5401(90)90033-eopenalex-snapshot
Tools for proving inductive equalities, relative completeness, and ω-completeness
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.1137/0217063openalex-snapshot
Axiomatising Finite Concurrent Processes
inferredcites →https://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types

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.1007/11523468_61openalex-snapshot
A Finite Basis for Failure Semantics
inferred← citeshttps://doi.org/10.1007/11548133_4openalex-snapshot
Bisimilarity Is Not Finitely Based over BPA with Interrupt
inferred← citeshttps://doi.org/10.1007/11601548_18openalex-snapshot
Finite Equational Bases in Process Algebra: Results and Open Questions
inferred← citeshttps://doi.org/10.1007/11690634_1openalex-snapshot
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
inferred← citeshttps://doi.org/10.1007/11787006_41openalex-snapshot
On the Axiomatizability of Priority
inferred← citeshttps://doi.org/10.1007/11787006_42openalex-snapshot
A Finite Equational Base for CCS with Left Merge and Communication Merge
inferred← citeshttps://doi.org/10.1007/11817949_28openalex-snapshot
On Finite Alphabets and Infinite Bases III: Simulation
inferred← citeshttps://doi.org/10.1007/11921240_14openalex-snapshot
Capture-Avoiding Substitution as a Nominal Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_4openalex-snapshot
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_61openalex-snapshot
An ω-Complete Equational Specification of Interleaving
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_10openalex-snapshot
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_1openalex-snapshot
Full abstraction for series-parallel pomsets
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_14openalex-snapshot
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_17openalex-snapshot
A Distribution Law for CCS and a New Congruence Result for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_5openalex-snapshot
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_2openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_18openalex-snapshot
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_4openalex-snapshot
Axiomatizing Weak Ready Simulation Semantics over BCCSP
inferred← citeshttps://doi.org/10.1007/bfb0014316openalex-snapshot
An equational axiomatization of observation congruence for prefix iteration
inferred← citeshttps://doi.org/10.1007/s00165-007-0056-1openalex-snapshot
Capture-avoiding substitution as a nominal algebra
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90057-4openalex-snapshot
Which data types have ω-complete initial algebra specifications?
inferred← citeshttps://doi.org/10.1016/j.ic.2004.02.001openalex-snapshot
Nested semantics over finite trees are equationally hard
inferred← citeshttps://doi.org/10.1016/j.ic.2007.09.003openalex-snapshot
On finite alphabets and infinite bases
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.019openalex-snapshot
The equational theory of prebisimilarity over basic CCS with divergence
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.003openalex-snapshot
Ready to preorder: The case of weak process semantics
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.09.014openalex-snapshot
A ground-complete axiomatization of stateless bisimilarity over Linda
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.003openalex-snapshot
CCS with Hennessy's merge has no finite-equational axiomatization
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.003openalex-snapshot
Bisimilarity is not finitely based over BPA with interrupt
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.013openalex-snapshot
Axiomatizing weak simulation semantics over BCCSP
inferred← citeshttps://doi.org/10.1017/s0960129507006524openalex-snapshot
On the axiomatisability of priority
inferred← citeshttps://doi.org/10.1109/lics.2008.13openalex-snapshot
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
inferred← citeshttps://doi.org/10.1137/s0097539793243600openalex-snapshot
On “Axiomatising Finite Concurrent Processes”
inferred← citeshttps://doi.org/10.1145/1459010.1459016openalex-snapshot
A finite equational base for CCS with left merge and communication merge
inferred← citeshttps://doi.org/10.1145/3529535openalex-snapshot
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:17)2015openalex-snapshot
On the Axiomatizability of Impossible Futures
inferred← citeshttps://doi.org/10.2168/lmcs-4(2:4)2008openalex-snapshot
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
inferred← citeshttps://doi.org/10.3233/fun-2008-881-201openalex-snapshot
A Cancellation Theorem for BCCSP
inferred← citeshttps://doi.org/10.4204/eptcs.32.1openalex-snapshot
Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.8openalex-snapshot
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
inferred← citeshttps://doi.org/10.6100/ir498558openalex-snapshot
Discrete-time process algebra
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.