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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ferry Timmers, Jan Friso Groote
Format: Article
Language:English
Published: Alexandru Ioan Cuza University of Iasi 2020-08-01
Series:Scientific Annals of Computer Science
Subjects:
Online Access:https://www.info.uaic.ro/en/sacs_articles/a-complete-axiomatisation-for-probabilistic-trace-equivalence/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850263827343474688
author Ferry Timmers
Jan Friso Groote
author_facet Ferry Timmers
Jan Friso Groote
author_sort Ferry Timmers
collection DOAJ
description 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.
format Article
id doaj-art-e571cbabe6d541dd80a7fe057ebed722
institution OA Journals
issn 1843-8121
2248-2695
language English
publishDate 2020-08-01
publisher Alexandru Ioan Cuza University of Iasi
record_format Article
series Scientific Annals of Computer Science
spelling doaj-art-e571cbabe6d541dd80a7fe057ebed7222025-08-20T01:54:53ZengAlexandru Ioan Cuza University of IasiScientific Annals of Computer Science1843-81212248-26952020-08-01XXX16910410.7561/SACS.2020.1.69A Complete Axiomatisation for Probabilistic Trace EquivalenceFerry Timmers0Jan Friso Groote1https://orcid.org/0000-0003-2196-6587Department of Mathematics and Computer Science, Eindhoven University of TechnologyDepartment of Mathematics and Computer Science, Eindhoven University of Technol- ogyWe 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.https://www.info.uaic.ro/en/sacs_articles/a-complete-axiomatisation-for-probabilistic-trace-equivalence/probabilistic processestrace equivalencecomplete axiomatisation
spellingShingle Ferry Timmers
Jan Friso Groote
A Complete Axiomatisation for Probabilistic Trace Equivalence
Scientific Annals of Computer Science
probabilistic processes
trace equivalence
complete axiomatisation
title A Complete Axiomatisation for Probabilistic Trace Equivalence
title_full A Complete Axiomatisation for Probabilistic Trace Equivalence
title_fullStr A Complete Axiomatisation for Probabilistic Trace Equivalence
title_full_unstemmed A Complete Axiomatisation for Probabilistic Trace Equivalence
title_short A Complete Axiomatisation for Probabilistic Trace Equivalence
title_sort complete axiomatisation for probabilistic trace equivalence
topic probabilistic processes
trace equivalence
complete axiomatisation
url https://www.info.uaic.ro/en/sacs_articles/a-complete-axiomatisation-for-probabilistic-trace-equivalence/
work_keys_str_mv AT ferrytimmers acompleteaxiomatisationforprobabilistictraceequivalence
AT janfrisogroote acompleteaxiomatisationforprobabilistictraceequivalence
AT ferrytimmers completeaxiomatisationforprobabilistictraceequivalence
AT janfrisogroote completeaxiomatisationforprobabilistictraceequivalence