Resource bisimilarity and graded bisimilarity coincide
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
The equational theory of prebisimilarity over basic CCS with divergence
On the axiomatizability of priority II
CCS with Hennessy's merge has no finite-equational axiomatization
Guest editors’ foreword
A note on an expressiveness hierarchy for multi-exit iteration
The max-plus algebra of the natural numbers has no finite equational basis
Equational theories of tropical semirings
A complete equational axiomatization for MPA with string iteration
On a question of A. Salomaa the equational theory of regular expressions over a singleton alphabet is not finitely based
Lifting non-finite axiomatizability results to extensions of process algebras
Nested semantics over finite trees are equationally hard
Rule formats for determinism and idempotence