Computing strong and weak bisimulations for psi-calculi

We present a symbolic transition system and strong and weak bisimulationequivalences for psi-calculi, and show that they are fully abstract with respectto bisimulation congruences in the non-symbolic semantics. An algorithmwhich computes the most general constraint under which two agents arebisimilar is developed and proved correct.A psi-calculus is an extension of the pi-calculus with nominal data typesfor data structures and for logical assertions representing facts about data.These can be transmitted between processes and their names can be stat-ically scoped using the standard pi-calculus mechanism to allow for scopemigrations. Psi-calculi can be more general than other proposed extensionsof the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusioncalculus, or the concurrent constraint pi-calculus.Symbolic semantics are necessary for an efficient implementation of thecalculus in automated tools exploring state spaces, and the full abstractionproperty means the symbolic semantics makes exactly the same distinctionsas the original.