Algebraic specification of ABP protocol using different time constraints

Alternating Bit Protocol (ABP) is a timeless communication protocol but it might be spiced up by adding up some time constraints to it. According to that, four cases have been defined herein and then, formal specifications and verifications have been performed in them following the rules of a process algebra called Algebra of Communicating Processes (ACP). Oftentimes process algebras lead to cumbersome calculations that are most frequently done by using specific software packages such as mCRL2 or LOTOS, which might lead to lose perspective on the basics. In this paper, a simplifying trick is presented in order to ease up those calculations, thus making easier a manual approach to ACP algebraic derivations and hence, helping a better understanding of them.