{"title":"具有本地名称的并发ML片段的双仿真理论","authors":"A. Jeffrey, J. Rathke","doi":"10.1109/LICS.2000.855780","DOIUrl":null,"url":null,"abstract":"Concurrent ML is an extension of Standard ML with /spl pi/-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled transitions semantics provided for the entire language. We present a labelled transition semantics for a fragment of CML called /spl mu/vCML which includes features not covered before: dynamically generated local channels and thread identifiers. We show that weak bisimulation for /spl mu/vCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of D. Sangiorgi's (1993) normal bisimulation for /spl mu/vCML, and show that this too coincides with bisimulation.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"A theory of bisimulation for a fragment of Concurrent ML with local names\",\"authors\":\"A. Jeffrey, J. Rathke\",\"doi\":\"10.1109/LICS.2000.855780\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Concurrent ML is an extension of Standard ML with /spl pi/-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled transitions semantics provided for the entire language. We present a labelled transition semantics for a fragment of CML called /spl mu/vCML which includes features not covered before: dynamically generated local channels and thread identifiers. We show that weak bisimulation for /spl mu/vCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of D. Sangiorgi's (1993) normal bisimulation for /spl mu/vCML, and show that this too coincides with bisimulation.\",\"PeriodicalId\":300113,\"journal\":{\"name\":\"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2000.855780\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2000.855780","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A theory of bisimulation for a fragment of Concurrent ML with local names
Concurrent ML is an extension of Standard ML with /spl pi/-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled transitions semantics provided for the entire language. We present a labelled transition semantics for a fragment of CML called /spl mu/vCML which includes features not covered before: dynamically generated local channels and thread identifiers. We show that weak bisimulation for /spl mu/vCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of D. Sangiorgi's (1993) normal bisimulation for /spl mu/vCML, and show that this too coincides with bisimulation.