Branching bisimulation congruence for probabilistic systems

N. Trcka, S. Georgievska

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelProceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008, Budapest, Hungary, March 29-30, 2008)
RedacteurenA. Aldini, C. Baier
Pagina's129-143
DOI's
StatusGepubliceerd - 2008

Publicatie series

NaamElectronic Notes in Theoretical Computer Science
Volume220(3)
ISSN van geprinte versie1571-0061

Vingerafdruk

Duik in de onderzoeksthema's van 'Branching bisimulation congruence for probabilistic systems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit