摘要弱双相似的同余准则

International Symposium on Mathematical Foundations of Computer Science Pub Date : 2020-10-15 DOI:10.4230/LIPIcs.MFCS.2021.88

Stelios Tsampas, Christian Williams, Dominique Devriese, F. Piessens

{"title":"摘要弱双相似的同余准则","authors":"Stelios Tsampas, Christian Williams, Dominique Devriese, F. Piessens","doi":"10.4230/LIPIcs.MFCS.2021.88","DOIUrl":null,"url":null,"abstract":"We introduce three general compositionality criteria over operational semantics that guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's mathematical operational semantics and the coalgebraic approach to weak bisimulation by Brengos. We demonstrate each criterion with various examples of success and failure and give a formal proof of correctness for our main result.","PeriodicalId":369104,"journal":{"name":"International Symposium on Mathematical Foundations of Computer Science","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Abstract Congruence Criteria for Weak Bisimilarity\",\"authors\":\"Stelios Tsampas, Christian Williams, Dominique Devriese, F. Piessens\",\"doi\":\"10.4230/LIPIcs.MFCS.2021.88\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce three general compositionality criteria over operational semantics that guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's mathematical operational semantics and the coalgebraic approach to weak bisimulation by Brengos. We demonstrate each criterion with various examples of success and failure and give a formal proof of correctness for our main result.\",\"PeriodicalId\":369104,\"journal\":{\"name\":\"International Symposium on Mathematical Foundations of Computer Science\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Mathematical Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.MFCS.2021.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Mathematical Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.MFCS.2021.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们在操作语义上引入了三个保证弱双模拟是同余的一般组合性准则。我们的工作建立在Turi和Plotkin的数学运算语义和Brengos的弱双模拟的共代数方法的基础上。我们用各种成功和失败的例子来证明每个准则，并对我们的主要结果的正确性给出了正式的证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Abstract Congruence Criteria for Weak Bisimilarity

We introduce three general compositionality criteria over operational semantics that guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's mathematical operational semantics and the coalgebraic approach to weak bisimulation by Brengos. We demonstrate each criterion with various examples of success and failure and give a formal proof of correctness for our main result.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Symposium on Mathematical Foundations of Computer Science

自引率

0.00%

发文量