On the axiomatisability of priority. III: Priority strikes again

DOI10.1016/j.tcs.2020.07.044zbMath1452.68124OpenAlexW3047624070MaRDI QIDQ2193294

Elli Anastasiadi, Luca Aceto, Mathias Ruggaard Pedersen, Valentina Castiglioni, Bas Luttik, Anna Ingólfsdóttir

Publication date: 25 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.044

zbMATH Keywords

sequential compositionbisimilaritypriority operatorfinite axiomatisations

Mathematics Subject Classification ID

Logic in computer science (03B70) 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the axiomatizability of priority. II
• Transition system specifications with negative premises
• Bisimilarity is not finitely based over BPA with interrupt
• Deciding bisimilarity is P-complete
• The algebra of communicating processes with empty process
• On the Axiomatizability of Priority
• Process algebra for synchronous communication
• Three Partition Refinement Algorithms
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Formal verification of parallel programs
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: On the axiomatisability of priority. III: Priority strikes again