Congruent bisimulation equivalence of ambient calculus based on contextual transition system

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.

Original languageEnglish
Title of host publicationProceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013
Pages149-152
Number of pages4
DOIs
Publication statusPublished - 2013
Event2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013 - Birmingham, United Kingdom
Duration: Jul 1 2013Jul 3 2013

Other

Other2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013
CountryUnited Kingdom
CityBirmingham
Period7/1/137/3/13

Fingerprint

Labels

ASJC Scopus subject areas

  • Software

Cite this

Murakami, M. (2013). Congruent bisimulation equivalence of ambient calculus based on contextual transition system. In Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013 (pp. 149-152). [6597891] https://doi.org/10.1109/TASE.2013.28

Congruent bisimulation equivalence of ambient calculus based on contextual transition system. / Murakami, Masaki.

Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013. 2013. p. 149-152 6597891.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Murakami, M 2013, Congruent bisimulation equivalence of ambient calculus based on contextual transition system. in Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013., 6597891, pp. 149-152, 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013, Birmingham, United Kingdom, 7/1/13. https://doi.org/10.1109/TASE.2013.28
Murakami M. Congruent bisimulation equivalence of ambient calculus based on contextual transition system. In Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013. 2013. p. 149-152. 6597891 https://doi.org/10.1109/TASE.2013.28
Murakami, Masaki. / Congruent bisimulation equivalence of ambient calculus based on contextual transition system. Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013. 2013. pp. 149-152
@inproceedings{070eb53b769c47039bae54e935c05552,
title = "Congruent bisimulation equivalence of ambient calculus based on contextual transition system",
abstract = "This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.",
author = "Masaki Murakami",
year = "2013",
doi = "10.1109/TASE.2013.28",
language = "English",
isbn = "9780768550534",
pages = "149--152",
booktitle = "Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013",

}

TY - GEN

T1 - Congruent bisimulation equivalence of ambient calculus based on contextual transition system

AU - Murakami, Masaki

PY - 2013

Y1 - 2013

N2 - This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.

AB - This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.

UR - http://www.scopus.com/inward/record.url?scp=84886392330&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886392330&partnerID=8YFLogxK

U2 - 10.1109/TASE.2013.28

DO - 10.1109/TASE.2013.28

M3 - Conference contribution

AN - SCOPUS:84886392330

SN - 9780768550534

SP - 149

EP - 152

BT - Proceedings - 2013 International Symposium on Theoretical Aspects of Software Engineering, TASE 2013

ER -