Trustworthy Systems

Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours


Nick Fischer and Rob van Glabbeek


Saarland University

UNSW Sydney


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.

BibTeX Entry

    author           = {Fischer, Nick and van Glabbeek, Robert},
    date             = {2019-1-2},
    doi              = {},
    journal          = {Journal of Logical and Algebraic Methods in Programming},
    keywords         = {Axiomatisation; Process algebra; Probability; Recursion},
    month            = jan,
    pages            = {64-102},
    paperurl         = {},
    publisher        = {Elsevier},
    title            = {Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours},
    volume           = {102},
    year             = {2019}