A fully abstract encoding for sub asynchronous pi calculus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The paper investigates a notion of sub asynchronous pi-calculus in asynchronous communication. The emphasises of the research are the basic operation and encoding theory of this novel subcalculus. We focus on behavioural equivalences, accurately on barbed congruence and bisimilarity. The congruence of bisimilarity and characterisation of barbed congruence in sub asynchronous pi-calculus are novel and directly proved. The encoding from pi-calculus to sub asynchronous pi-calculus is validated to be complete and sound. Consequently, the results in this paper bring out theoretical foundations for constructing fully abstract encodings from synchronous to asynchronous.

Original languageEnglish
Title of host publicationProceedings - 2018 12th International Symposium on Theoretical Aspects of Software Engineering, TASE 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538673058
DOIs
StatePublished - 4 Dec 2018
Event12th International Symposium on Theoretical Aspects of Software Engineering, TASE 2018 - Guangzhou, China
Duration: 29 Aug 201831 Aug 2018

Publication series

NameProceedings - 2018 12th International Symposium on Theoretical Aspects of Software Engineering, TASE 2018
Volume2018-January

Conference

Conference12th International Symposium on Theoretical Aspects of Software Engineering, TASE 2018
Country/TerritoryChina
CityGuangzhou
Period29/08/1831/08/18

Keywords

  • Behavioural equivalence
  • Bisimulation
  • Completeness
  • Encoding
  • Fully abstract
  • Sub asynchronous pi-calculus

Fingerprint

Dive into the research topics of 'A fully abstract encoding for sub asynchronous pi calculus'. Together they form a unique fingerprint.

Cite this