A THEORY FOR SIMULATORS

This paper presents a formalisation of the notion simulator for proces s languages like ACP, CCS, (mu)CRL, LOTOS and PSF. Precise definitions for the notions simulator and simulation are given. Moreover, the equ ivalence that a simulator induces on the explored process terms is inv estigated. This is done by considering two processes p and q equivalen t if each simulation of p is also a simulation of q and vice versa. It is proven that there is no 'reasonable' simulator inducing bisimulati on equivalence.