Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Enabledness and termination in refinement algebra

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • بيانات النشر:
      Elsevier
    • الموضوع:
      2009
    • Collection:
      The University of Queensland: UQ eSpace
    • نبذة مختصرة :
      Refinement algebras are abstract algebras for reasoning about programs in a total correctness framework. We extend a reduct of von Wright's demonic refinement algebra with two operators for modelling enabledness and termination of programs. We show how the operators can be used for expressing relations between programs and apply the algebra to reasoning about action systems.
    • ISSN:
      0167-6423
      1872-7964
    • الرقم المعرف:
      edsbas.64E27B3F