Lehrstuhl Ff Ur Informatik Vii (rechnerarchitektur Und Verkehrstheorie) Observational Congruence in a Stochastic Timed Calculus with Maximal Progress Observational Congruence in a Stochastic Timed Calculus with Maximal Progress

During the last decade, CCS has been extended in diierent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 31]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by the axiom recX:(:X + P) = recX:::P. In this paper we discuss observational congruence in the context of a simple stochastic timed CCS with maximal progress. This property implies that observational congruence becomes unfair, i.e. it is not always possible to escape divergence. This problem also arises in calculi with priority. Therefore, completeness results for such calculi modulo observational congruence have been unknown until now. We obtain a complete proof system by replacing the above axiom by a set of axioms allowing to escape divergence by means of a silent alternative. This treatment can be prootably adapted to other calculi.