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.
|Number of pages||36|
|Journal||Scientific Annals of Computer Science|
|Publication status||Published - 2020|
- Complete ax-iomatisation
- Probabilistic processes
- Trace equivalence