Concurrent semantics for the pi-calculus

In this paper we give both operational and abstract concurrent semantics for the calculus a process algebra with the ability of handling channels as messages and discuss their consistency For the operational semantics we map the language into graph rewriting systems which are already equipped with a concurrent seman tics for the abstract semantics we introduce interleaving partial ordering and mixed ordering observations de ne the corresponding bisimulation relations and discuss them