2014/08/26 by Franco Barbanera, Mariangiola Dezani-Ciancaglini, Ugo de' Liguoro
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.162.5
published as EPTCS 162, 2014, pp. 35-42 · In Proceedings BEAT 2014, arXiv:1408.5564
arxiv created 2014/08/26 · arxiv updated 2014/08/27
In the setting of session behaviours, we study an extension of the concept of compliance when a disciplined form of backtracking is present. After adding checkpoints to the syntax of session behaviours, we formalise the operational semantics via a LTS, and define a natural notion of checkpoint compliance. We then obtain a co-inductive characterisation of such compliance relation, and an axiomatic presentation that is proved to be sound and complete. As a byproduct we get a decision procedure for the new compliance, being the axiomatic system algorithmic.