A fully abstract symbolic semantics for psi-calculi

zbMATH Open1454.68076MaRDI QIDQ5150128FDOQ5150128

Authors: Magnus Johansson, Björn Victor, Joachim Parrow 

Publication date: 9 February 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?SOS2009.2

Recommendations

• Computing strong and weak bisimulations for psi-calculi
• Psi-calculi: a framework for mobile processes with nominal data and logic
• scientific article; zbMATH DE number 7288621
• A symbolic semantics for the \(\pi\)-calculus
• Psi-calculi in Isabelle

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Computing strong and weak bisimulations for psi-calculi
• Title not available (Why is that?)
• Psi-calculi revisited: connectivity and compositionality
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Priorities without priorities: representing preemption in psi-calculi

This page was built for publication: A fully abstract symbolic semantics for psi-calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150128)