uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Fully Abstract Symbolic Semantics for Psi-Calculi
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
2010 (English)In: Proc. 6th Workshop on Structural Operational Semantics: SOS 2009, 2010, 17-31 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics.

A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Psi-calculi can be more general than other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, or the concurrent constraint pi-calculus.

Symbolic semantics are necessary for an efficient implementation of the calculus in automated tools exploring state spaces, and the full abstraction property means the semantics of a process does not change from the original.

Place, publisher, year, edition, pages
2010. 17-31 p.
Series
Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180 ; 18
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-108120DOI: 10.4204/EPTCS.18.2OAI: oai:DiVA.org:uu-108120DiVA: diva2:234400
Conference
Structural Operational Semantics 2009
Projects
UPMARCProFun
Available from: 2009-09-08 Created: 2009-09-08 Last updated: 2016-02-25

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Johansson, MagnusVictor, BjörnParrow, Joachim

Search in DiVA

By author/editor
Johansson, MagnusVictor, BjörnParrow, Joachim
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 754 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf