In this paper we extend Real Time Process Algebra by the silent step τ. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting τ-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct.

Additional Metadata
Persistent URL dx.doi.org/10.1007/BFb0031999
Conference Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems)
Citation
Klusener, A.S. (1991). Abstraction in real time process algebra. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 325–352). doi:10.1007/BFb0031999