{"title":"基于上下文转换系统的环境微积分的同余双模拟等价","authors":"M. Murakami","doi":"10.1109/TASE.2013.28","DOIUrl":null,"url":null,"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.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System\",\"authors\":\"M. Murakami\",\"doi\":\"10.1109/TASE.2013.28\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":346899,\"journal\":{\"name\":\"2013 International Symposium on Theoretical Aspects of Software Engineering\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Symposium on Theoretical Aspects of Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TASE.2013.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Symposium on Theoretical Aspects of Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TASE.2013.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
