On the axiomatisability of priority

DOI10.1017/S0960129507006524zbMath1141.68042OpenAlexW2028222735MaRDI QIDQ5458057

Taolue Chen, Anna Ingólfsdóttir, Luca Aceto, W. J. Fokkink

Publication date: 10 April 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129507006524

zbMATH Keywords

process algebrabisimulation equivalence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Replacement freeness: a criterion for separating process calculi ⋮ An independent axiomatisation for free short-circuit logic ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ On the axiomatizability of priority. II ⋮ Non-commutative propositional logic with short-circuit evaluation

Cites Work

• Priorities in process algebras
• Bisimilarity is not finitely based over BPA with interrupt
• CCS with priority choice
• Nonaxiomatisability of equivalences over finite state processes
• CCS with Hennessy's merge has no finite-equational axiomatization
• On the expressive power of CCS
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced

This page was built for publication: On the axiomatisability of priority