Abstract Congruence Criteria for Weak Bisimilarity

Stelios Tsampas, Christian Williams, Dominique Devriese, F. Piessens
{"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}
引用次数: 2

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
摘要弱双相似的同余准则
我们在操作语义上引入了三个保证弱双模拟是同余的一般组合性准则。我们的工作建立在Turi和Plotkin的数学运算语义和Brengos的弱双模拟的共代数方法的基础上。我们用各种成功和失败的例子来证明每个准则,并对我们的主要结果的正确性给出了正式的证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges Dynamic constant time parallel graph algorithms with sub-linear work Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids Entropic Risk for Turn-Based Stochastic Games On the Expressive Power of Regular Expressions with Backreferences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1