概率迹等价的一个完全公理化

Sci. Ann. Comput. Sci. Pub Date : 2020-08-31 DOI:10.7561/SACS.2020.1.69

Ferry Timmers, J. F. Groote

{"title":"概率迹等价的一个完全公理化","authors":"Ferry Timmers, J. F. Groote","doi":"10.7561/SACS.2020.1.69","DOIUrl":null,"url":null,"abstract":"We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated by Bernardo et al., 2014, in the setting of the alternating model of Hansson. The equivalence considers traces individually instead of trace distributions. We show that our axiomatisation is sound and also complete for recursion-free sequential processes. Due to the nature of the trace equivalence, the axiomatisation is particularly complex.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Complete Axiomatisation for Probabilistic Trace Equivalence\",\"authors\":\"Ferry Timmers, J. F. Groote\",\"doi\":\"10.7561/SACS.2020.1.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated by Bernardo et al., 2014, in the setting of the alternating model of Hansson. The equivalence considers traces individually instead of trace distributions. We show that our axiomatisation is sound and also complete for recursion-free sequential processes. Due to the nature of the trace equivalence, the axiomatisation is particularly complex.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2020.1.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2020.1.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们提供了=pTr的公理化，这是由Bernardo等人在2014年制定的概率迹等效的变体，在汉森交替模型的设置中。等效性单独考虑跟踪，而不是考虑跟踪分布。我们证明了我们的公理化是健全的，并且对于无递归的顺序过程也是完整的。由于迹等效的性质，公理化是特别复杂的。

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

查看原文本刊更多论文

A Complete Axiomatisation for Probabilistic Trace Equivalence

We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated by Bernardo et al., 2014, in the setting of the alternating model of Hansson. The equivalence considers traces individually instead of trace distributions. We show that our axiomatisation is sound and also complete for recursion-free sequential processes. Due to the nature of the trace equivalence, the axiomatisation is particularly complex.

求助全文

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

来源期刊

Sci. Ann. Comput. Sci.

自引率

0.00%

发文量