Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours

https://doi.org/10.1016/j.jlamp.2018.09.006Get rights and content
Under an Elsevier user license
open archive

Abstract

In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same observable behaviour. The probabilistic environment gives rise to several generalisations; we study the infinitary semantics, which abstracts from a potentially unbounded number of internal actions being performed when something observable happens. Arguing that this notion yields the most desirable properties, we provide a sound and complete axiomatisation capturing its essence. Previous research has failed to achieve completeness in the presence of unguarded recursion, as only the finitary variant has been axiomatised, yet.

Keywords

Axiomatisation
Process algebra
Probability
Recursion

Cited by (0)