Computing strong and weak bisimulations for psi-calculi

We present a symbolic transition system and strong and weak bisimulation equivalences for psi-calculi, and show that they are fully abstract with respect to bisimulation congruences in the non-symbolic semantics. A procedure which computes the most general constraint under which two agents are bisim...

Full description

Saved in:

Bibliographic Details
Published in:	The journal of logic and algebraic programming Vol. 81; no. 3; pp. 162 - 180
Main Authors:	Johansson, Magnus, Victor, Björn, Parrow, Joachim
Format:	Journal Article
Language:	English
Published:	01.04.2012
Subjects:	Bisimulation Computer Science Datavetenskap Full abstraction Psi-calculi Symbolic semantics TECHNOLOGY TEKNIKVETENSKAP
ISSN:	1567-8326, 1873-5940
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!