Abstract
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three
topics are covered: (i) specification of processes using finite systems of equations over the
syntax of process algebra; (ii) inference systems which are complete for proving the
equivalence of regular (finite state) processes; (iii) variations of the bisimulation
... read more
