On the public citation graph
The importance of the left merge operator in process algebras
0 signed · 88 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/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
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(93)90176-topenalex-snapshot
Unique decomposition of processes
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/11787006_41openalex-snapshot
On the Axiomatizability of Priority
inferred← citeshttps://doi.org/10.1007/11817949_28openalex-snapshot
On Finite Alphabets and Infinite Bases III: Simulation
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-45315-6_26openalex-snapshot
An Axiomatic Semantics for the Synchronous Language Gentzen
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-3-030-30985-5_26openalex-snapshot
An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice
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-15102-1_2openalex-snapshot
Behavior Modeling for Interaction
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_50openalex-snapshot
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_6openalex-snapshot
Impossibility Results for the Equational Theory of Timed CCS
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-85361-9_11openalex-snapshot
A Context-Free Process as a Pushdown Automaton
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_3openalex-snapshot
Process Algebra: An Algebraic Theory of Concurrency
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-33475-7_18openalex-snapshot
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
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.1007/s002360050129openalex-snapshot
Nonfinite axiomatizability of the equational theory of shuffle
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00152-9openalex-snapshot
Structural operational semantics for weak bisimulations
inferred← citeshttps://doi.org/10.1016/bs.adcom.2014.10.003openalex-snapshot
Advances in Behavior Modeling
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.076openalex-snapshot
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
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.2009.06.012openalex-snapshot
A Basic Parallel Process as a Parallel Pushdown Automaton
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.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.2004.11.019openalex-snapshot
Decomposition orders—another generalisation of the fundamental theorem of arithmetic
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.2012.07.036openalex-snapshot
Rule formats for distributivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.013openalex-snapshot
Unique parallel decomposition in branching and weak bisimulation semantics
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.1016/j.tcs.2025.115325openalex-snapshot
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00003-5openalex-snapshot
An axiomatic semantics for the synchronous language Gentzen
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00420-5openalex-snapshot
An axiomatic semantics for Esterel
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00214-5openalex-snapshot
Finite axiom systems for testing preorder and De Simone process languages
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/s0960129507006524openalex-snapshot
On the axiomatisability of priority
inferred← citeshttps://doi.org/10.1109/lics.1990.113741openalex-snapshot
The nonexistence of finite axiomatisations for CCS congruences
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.1109/wcica.2012.6358386openalex-snapshot
Polynomial process algebra
inferred← citeshttps://doi.org/10.1142/9789812562494_0053openalex-snapshot
SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA
inferred← citeshttps://doi.org/10.1145/1363686.1363775openalex-snapshot
A framework for performance evaluation and functional verification in stochastic process algebras
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.1145/3776649openalex-snapshot
Hyperfunctions: Communicating Continuations
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-11092008-103831openalex-snapshot
ACP e LOTOS: um estudo comparativo baseado em conceitos de BPEL e padrões de controle de fluxo
inferred← citeshttps://doi.org/10.11606/d.45.2012.tde-30092012-185006openalex-snapshot
Tratamento de eventos aplicado à composição de serviços web
inferred← citeshttps://doi.org/10.11606/t.45.2008.tde-27102008-100359openalex-snapshot
Geração de expressões algébricas para processos de negócio usando reduções de digrafos série-paralelo
inferred← citeshttps://doi.org/10.3990/1.9789036548984openalex-snapshot
Deductive techniques for model-based concurrency verification
inferred← citeshttps://doi.org/10.4204/eptcs.222.4openalex-snapshot
Unique Parallel Decomposition for the Pi-calculus
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.46298/lmcs-18(1:15)2022openalex-snapshot
On the Axiomatisability of Parallel Composition
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2117openalex-snapshot
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05260openalex-snapshot
Reversible Quantum Process Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1507.03344openalex-snapshot
Reversible Quantum Process Algebra with Guards
inferred← citeshttps://doi.org/10.48550/arxiv.1611.09035openalex-snapshot
Algebraic Laws for True Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01070openalex-snapshot
Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing
inferred← citeshttps://doi.org/10.48550/arxiv.2010.09645openalex-snapshot
On the Parallel Composition for True Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05438openalex-snapshot
Actors -- A Process Algebra Based Approach
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08453openalex-snapshot
Probabilistic Process Algebra for True Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.2109.05936openalex-snapshot
Truly Concurrent Process Algebra with Localities
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11416openalex-snapshot
Verification of Distributed Quantum Protocols
inferred← citeshttps://doi.org/10.7146/brics.v10i27.21795openalex-snapshot
Nested Semantics over Finite Trees are Equationally Hard
inferred← citeshttps://doi.org/10.7146/brics.v10i34.21802openalex-snapshot
CCS with Hennessy's Merge has no Finite Equational Axiomatization
inferred← citeshttps://doi.org/10.7146/brics.v11i1.21826openalex-snapshot
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
inferred← citeshttps://doi.org/10.7146/brics.v11i24.21849openalex-snapshot
Bisimilarity is not Finitely Based over BPA with Interrupt
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.v12i33.21900openalex-snapshot
Bisimilarity is not Finitely Based over BPA with Interrupt
inferred← citeshttps://doi.org/10.7146/brics.v13i1.21907openalex-snapshot
On the Axiomatizability of Priority
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.v14i5.21928openalex-snapshot
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/brics.v7i20.20147openalex-snapshot
2-Nested Simulation is not Finitely Equationally Axiomatizable
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.