We present two extensions of pcrl with time-stamped actions: pcrlat for absolute time and pcrlrt for relative time. We define timed bisimilarity for both versions and prove that the given axiomatisations are ground complete, provided that the data types have built-in equality and Skolem functions. We base the completeness proofs on the completeness results for untimed pcrl.

, ,
Software Engineering [SEN]

van der Zwaag, M.B. (2000). Time-stamped actions in pCRL algebras. Software Engineering [SEN]. CWI.