Process Algebra with Goal Based Bisimulation

There is strong and weak bisimulation relationships in process algebras. These relationships compare processes on action-pairs. However, they can not specify another equivalent relationship based on the ``goal´´ of processes. That is, processes starting from the same initial state, and end on the same state, are also a kind of equivalent relationship. In this paper, we propose goal based bisimulation under the framework of process algebra. This goal based bisimulation can classify processes on a more abstract level.