Ready to preorder: The case of weak process semantics

  • Authors:

  • Taolue Chen;Wan Fokkink;Rob van Glabbeek

  • Affiliations:

  • CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands;National ICT Australia, Locked Bag 6016, Sydney, NSW 1466, Australia and The University of New South Wales, School of Computer Science and Engineering, Sydney, NSW 2052, Australia

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.89

Visualization

Abstract

Recently, Aceto, Fokkink and Ingolfsdottir proposed an algorithm to turn any sound and ground-complete axiomatisation of any preorder listed in the linear time-branching time spectrum at least as coarse as the ready simulation preorder, into a sound and ground-complete axiomatisation of the corresponding equivalence-its kernel. Moreover, if the former axiomatisation is @w-complete, so is the latter. Subsequently, de Frutos Escrig, Gregorio Rodriguez and Palomino generalised this result, so that the algorithm is applicable to any preorder at least as coarse as the ready simulation preorder, provided it is initials preserving. The current paper shows that the same algorithm applies equally well to weak semantics: the proviso of initials preserving can be replaced by other conditions, such as weak initials preserving and satisfying the second @t-law. This makes it applicable to all 87 preorders surveyed in ''the linear time-branching time spectrum II'' that are at least as coarse as the ready simulation preorder. We also extend the scope of the algorithm to infinite processes, by adding recursion constants. As an application of both extensions, we provide a ground-complete axiomatisation of the CSP failures equivalence for BCCS processes with divergence.