On the public citation graph
A Finite Basis for Failure Semantics
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.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-44693-1_4openalex-snapshot
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
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-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
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/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
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/0168-0072(90)90049-8openalex-snapshot
Equational theory of positive numbers with exponentiation is not finitely axiomatizable
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for 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/b978-0-444-82830-9.x5017-6openalex-snapshot
Handbook of Process Algebra
inferredcites →https://doi.org/10.1016/b978-044482830-9/50019-9openalex-snapshot
The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the…
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.1090/s0002-9947-1951-0044470-3openalex-snapshot
Identities in Two-Valued Calculi
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1142/s0218196796000040openalex-snapshot
TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/11817949_28openalex-snapshot
On Finite Alphabets and Infinite Bases III: Simulation
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-95891-8_18openalex-snapshot
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
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.jlap.2008.09.001openalex-snapshot
Ready to preorder: an algebraic and general proof
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:17)2015openalex-snapshot
On the Axiomatizability of Impossible Futures
inferred← citeshttps://doi.org/10.3233/fun-2008-881-201openalex-snapshot
A Cancellation Theorem for BCCSP
inferred← citeshttps://doi.org/10.7146/brics.v12i19.21885openalex-snapshot
Finite Equational Bases in Process Algebra: Results and Open Questions
inferred← citeshttps://doi.org/10.7146/brics.v14i3.21926openalex-snapshot
Ready To Preorder: Get Your BCCSP Axiomatization for Free!
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.