On the axiomatisability of priority. III: Priority strikes again

DOI10.1016/J.TCS.2020.07.044MaRDI QIDQ2193294zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

• On the axiomatizability of priority. II
• 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?
• On the axiomatisability of priority
• Bisimilarity is not finitely based over BPA with interrupt
• On the expressibility of priority
• On the Axiomatizability of Priority

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)