Regular Processes with Relative Time and Silent Steps

摘要

A study in which recursion is added to real time process algebra is presented. Anelimination theorem and a completeness result are proven for regular processes, where the time domain is restricted to the rational numbers. The alphabet is extended with the silent step tau and completeness is deduced for regular processes with relations to rooted branching bisimulation.