On the public citation graph
Finite Equational Bases in Process Algebra: Results and Open Questions
0 signed · 87 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/11523468_61openalex-snapshot
A Finite Basis for Failure Semantics
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-13345-3_7openalex-snapshot
The algebra of recursively defined processes and the algebra of regular processes
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-46691-6_25openalex-snapshot
Series and Parallel Operations on Pomsets
inferredcites →https://doi.org/10.1007/3-540-48523-6_38openalex-snapshot
Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)
inferredcites →https://doi.org/10.1007/3-540-55210-3_223openalex-snapshot
An interactive proof tool for process algebras
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-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
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/bfb0032072openalex-snapshot
The importance of the left merge operator in process algebras
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/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
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/0304-3975(88)90124-7openalex-snapshot
The equational theory of pomsets
inferredcites →https://doi.org/10.1016/0304-3975(94)90057-4openalex-snapshot
Which data types have ω-complete initial algebra specifications?
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.1016/j.ic.2004.02.001openalex-snapshot
Nested semantics over finite trees are equationally hard
inferredcites →https://doi.org/10.1016/j.tcs.2004.07.036openalex-snapshot
A brief history of process algebra
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/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/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
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.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/978-0-387-09680-3_21openalex-snapshot
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_27openalex-snapshot
Universal Coinductive Characterisations of Process Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_1openalex-snapshot
Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction
inferred← citeshttps://doi.org/10.1007/978-3-319-68972-2_3openalex-snapshot
Bisimilarity of Open Terms in Stream GSOS
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_14openalex-snapshot
Is Observational Congruence Axiomatisable in Equational Horn Logic?
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-642-14162-1_38openalex-snapshot
On Bisimilarity and Substitution in Presence of Replication
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_5openalex-snapshot
Rule Formats for Distributivity
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/978-3-642-27660-6_12openalex-snapshot
The Equational Theory of Weak Complete Simulation Semantics over BCCSP
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_5openalex-snapshot
Exploiting Algebraic Laws to Improve Mechanized Axiomatizations
inferred← citeshttps://doi.org/10.1007/s00236-010-0114-7openalex-snapshot
Lifting non-finite axiomatizability results to extensions of process algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.086openalex-snapshot
What is algebraic in process theory?
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.07.025openalex-snapshot
Impossibility Results in the Equational Logic of Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.059openalex-snapshot
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.093openalex-snapshot
On the Unification of Process Semantics: Equational Semantics
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.ic.2009.05.005openalex-snapshot
Is observational congruence on μ -expressions axiomatisable in equational Horn logic?
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.2011.01.015openalex-snapshot
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
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.2012.07.036openalex-snapshot
Rule formats for distributivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.013openalex-snapshot
Axiomatizing weak simulation semantics over BCCSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.044openalex-snapshot
On the axiomatisability of priority III: Priority strikes again
inferred← citeshttps://doi.org/10.1017/s0960129511000417openalex-snapshot
Proving the validity of equations in GSOS languages using rule-matching bisimilarity
inferred← citeshttps://doi.org/10.1109/lics.2008.13openalex-snapshot
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470526openalex-snapshot
In search of lost time: Axiomatising parallel composition in process algebras
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.2168/lmcs-9(2:11)2013openalex-snapshot
Unifying the Linear Time-Branching Time Spectrum of Process Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.18.1openalex-snapshot
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
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.48550/arxiv.cs/0608001openalex-snapshot
A Finite Equational Base for CCS with Left Merge and Communication Merge
inferred← citeshttps://doi.org/10.70675/ea795992z3e96z40ebz99dcz23d58523b460openalex-snapshot
An operational semantics of interactions for verifying partially observed executions of distributed systems
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.v12i20.21886openalex-snapshot
Cryptography in the Bounded Quantum Storage Model
inferred← citeshttps://doi.org/10.7146/brics.v12i21.21887openalex-snapshot
General Logical Metatheorems for Functional Analysis
inferred← citeshttps://doi.org/10.7146/brics.v12i27.21894openalex-snapshot
A Calculus for Context-Awareness
inferred← citeshttps://doi.org/10.7146/brics.v13i6.21912openalex-snapshot
A Finite Equational Base for CCS with Left Merge and Communication Merge
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.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.