A complete axiomatization of weighted branching bisimulation

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

We propose an axiomatization for weighted branching bisimulation over a weighted process algebra with positive rational weights including zero and show that this axiomatization is both sound and complete. Our proof of soundness and completeness are inspired by similar results by Milner for strong and weak bisimulation and by van Glabbeek for branching bisimulation. We also show that the claim that weighted branching bisimilarity is an equivalence relation indeed holds true. As auxiliary results, we give two alternative characterizations of weighted branching bisimulation, one in terms of weighted stuttering transitions and another in terms of a relative branching base which can be seen as a linear basis from which we can construct all weighted stuttering transitions.
OriginalsprogEngelsk
TidsskriftActa Informatica
Vol/bind57
Sider (fra-til)689-725
Antal sider37
ISSN0001-5903
DOI
StatusUdgivet - 1 okt. 2020

Fingeraftryk

Dyk ned i forskningsemnerne om 'A complete axiomatization of weighted branching bisimulation'. Sammen danner de et unikt fingeraftryk.

Citationsformater