A complete equational axiomatization for prefix iteration

Register-machine based processes

Journal of the ACM (JACM)

E-unifiability via Narrowing

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science

Embedding untimed into timed process algebra: the case for explicit termination

Mathematical Structures in Computer Science

A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces

Mathematical Structures in Computer Science

On the complete axiomatization for prefix iteration modulo observation congruence

Acta Cybernetica

Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration

Electronic Notes in Theoretical Computer Science (ENTCS)

Is observational congruence on μ-expressions axiomatisable in equational Horn logic?

Information and Computation

Model theory for process algebra

Processes, Terms and Cycles

A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION

Fundamenta Informaticae

Is observational congruence axiomatisable in equational horn logic?

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory