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...

Celý popis

Podrobná bibliografia

Vydané v:	The journal of logic and algebraic programming Ročník 81; číslo 3; s. 162 - 180
Hlavní autori:	Johansson, Magnus, Victor, Björn, Parrow, Joachim
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	01.04.2012
Predmet:	Bisimulation Computer Science Datavetenskap Full abstraction Psi-calculi Symbolic semantics TECHNOLOGY TEKNIKVETENSKAP
ISSN:	1567-8326, 1873-5940
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!