On the axiomatizability of priority. II

DOI10.1016/j.tcs.2011.02.033zbMath1216.68181OpenAlexW4205992029WikidataQ62047468 ScholiaQ62047468MaRDI QIDQ549169

Luca Aceto, Bas Luttik, Jaco van de Pol, Taolue Chen, Anna Ingólfsdóttir

Publication date: 7 July 2011

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

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

zbMATH Keywords

process algebraequational logicbisimilaritynon-finitely based algebraspriority operator

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

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ On the axiomatisability of priority. III: Priority strikes again

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priorities in process algebras
• CCS with priority choice
• A structural approach to operational semantics
• On deciding readiness and failure equivalences for processes
• Process algebra for synchronous communication
• Bisimulation can't be traced
• Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
• ALGORITHMIC PROBLEMS IN VARIETIES
• On the axiomatisability of priority