On the axiomatisability of priority. III: Priority strikes again

DOI10.1016/J.TCS.2020.07.044zbMATH Open1452.68124OpenAlexW3047624070MaRDI QIDQ2193294FDOQ2193294

Authors: Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik, Mathias Ruggaard Pedersen 

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

Recommendations

• On the axiomatisability of priority
• On the axiomatizability of priority. II
• On the Axiomatizability of Priority
• Bisimilarity is not finitely based over BPA with interrupt
• Algebra and Coalgebra in Computer Science

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)

Cites Work

• Asymptotic Enumeration of Partial Orders on a Finite Set
• Deciding bisimilarity is P-complete
• Structural operational semantics.
• Process algebra for synchronous communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation can't be traced
• Three Partition Refinement Algorithms
• Handbook of process algebra
• Formal verification of parallel programs
• The algebra of communicating processes with empty process
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Priority in process algebra.
• The meaning of negative premises in transition system specifications
• Title not available (Why is that?)
• Transition system specifications with negative premises
• Title not available (Why is that?)
• Processes, Terms and Cycles: Steps on the Road to Infinity
• On the axiomatizability of priority. II
• Title not available (Why is that?)
• Bisimilarity is not finitely based over BPA with interrupt
• On the Axiomatizability of Priority

Cited In (7)

• On the expressibility of priority
• On the axiomatisability of priority
• On the axiomatizability of priority. II
• Bisimilarity is not finitely based over BPA with interrupt
• On the Axiomatizability of Priority
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193294)