On compositionality, efficiency, and applicability of abstraction in probabilistic systems

S. Andova, S. Georgievska

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    6 Citaten (Scopus)


    A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axioms for strong bisimulation. We show that the Concurrent Alternating Bit protocol can be verified using the process algebra and a set of recursive rules.
    Originele taal-2Engels
    TitelSOFSEM 2009 : Theory and Practice of Computer Science (35th Conference, Spindleruv Mlyn, Czech Republic, January 24-30, 2009, Proceedings)
    RedacteurenM. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma, F. Valencia
    Plaats van productieBerlin
    ISBN van geprinte versie978-3-540-95890-1
    StatusGepubliceerd - 2009

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743


    Duik in de onderzoeksthema's van 'On compositionality, efficiency, and applicability of abstraction in probabilistic systems'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit