Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction

DOI10.1007/978-3-031-15629-8_1zbMath1524.68207MaRDI QIDQ6163879

Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Luca Aceto

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested semantics over finite trees are equationally hard
• Bisimilarity is not finitely based over BPA with interrupt
• Lifting non-finite axiomatizability results to extensions of process algebras
• Algebra of communicating processes with abstraction
• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• An algebra for process creation
• Turning SOS rules into equations
• CCS with Hennessy's merge has no finite-equational axiomatization
• On the axiomatisability of priority. III: Priority strikes again
• On the Axiomatizability of Impossible Futures
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Bisimulation can't be traced
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• Probabilistic Process Algebra and Strategic Interleaving
• A finite equational base for CCS with left merge and communication merge
• Processes, Terms and Cycles: Steps on the Road to Infinity