A Cook’s Tour of Equational Axiomatizations for Prefix Iteration


  • Luca Aceto
  • Willem Jan Fokkink
  • Anna Ingólfsdóttir




Prefix iteration is a variation on the original binary version of the
Kleene star operation P*Q, obtained by restricting the first argument to be an atomic action, and yields simple iterative behaviours that can be equationally characterized by means of finite collections of axioms. In this paper, we present axiomatic characterizations for a significant fragment of the notions of equivalence and preorder in van Glabbeek's linear-time/branching-time spectrum over Milner's basic CCS extended with prefix iteration. More precisely, we consider ready simulation, simulation, readiness, trace and language semantics, and provide complete (in)equational axiomatizations for each of these notions over BCCS with prefix iteration. All of the axiom systems we present are finite, if so is the set of atomic actions under consideration.




How to Cite

Aceto, L., Fokkink, W. J., & Ingólfsdóttir, A. (1998). A Cook’s Tour of Equational Axiomatizations for Prefix Iteration. BRICS Report Series, 5(49). https://doi.org/10.7146/brics.v5i49.19494