Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
From MaRDI portal
Publication:5056368
DOI10.1145/3529535OpenAlexW4224297410MaRDI QIDQ5056368
Anna Ingólfsdóttir, Luca Aceto, Valentina Castiglioni, Bas Luttik, W. J. Fokkink
Publication date: 8 December 2022
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.01943
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the axiomatizability of priority. II
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- 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
- A calculus of communicating systems
- Unique decomposition of processes
- Turning SOS rules into equations
- CCS with Hennessy's merge has no finite-equational axiomatization
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
- A structural approach to operational semantics
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Probabilistic divide \& congruence: branching bisimilarity
- On the axiomatisability of priority. III: Priority strikes again
- Equational Axioms for Probabilistic Bisimilarity
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Axiomatising Finite Concurrent Processes
- Formal verification of parallel programs
- Bisimulation can't be traced
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- A Complete Axiomatisation for Probabilistic Trace Equivalence
- Probabilistic Process Algebra and Strategic Interleaving
- A Specification Format for Rooted Branching Bisimulation
- A finite equational base for CCS with left merge and communication merge
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
