Branching Bisimulation Congruence for Probabilistic Systems | Zendy

Nikola Trčka | Zendy; Sonja Georgievska | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Branching Bisimulation Congruence for Probabilistic Systems

Author(s) -

Nikola Trčka,

Sonja Georgievska

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.11.023

Subject(s) - bisimulation , congruence (geometry) , probabilistic logic , branching (polymer chemistry) , mathematics , computer science , discrete mathematics , pure mathematics , geometry , statistics , materials science , composite material

The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define another branching bisimulation in the more general model allowing consecutive probabilistic transitions, and we prove that it is compatible with parallel composition. We then show that our bisimulation is actually the coarsest congruence relation included in the existing branching bisimulation when restricted to the alternating model

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research